Warehousing operation optimization model of one storey new dangerous goods warehouse based on warehousing chain and its application

2020 ◽  
Vol 01 ◽  
Author(s):  
Xiaguang Li ◽  
Xiefang Lin ◽  
Fangwei Zhang ◽  
Xufeng Tang ◽  
Ruolin Qiu ◽  
...  
Keyword(s):  
Numerical Simulation ◽  
Evaluation Model ◽  
Optimal Solution ◽  
The Novel ◽  
Allocation Model ◽  
Scheduling Scheme ◽  
Dangerous Goods ◽  
Novel Theory ◽  
Time Optimal ◽  
Scheme Evaluation

Introduction: In order to ensure the efficiency and cost of dangerous goods warehouse under the premise of safety, this study takes the dangerous goods warehouse as the research object and implements multitask for dangerous goods warehouse with two forklifts. Methods: This study takes traversal calculation, novel safety calculation formula and scheduling scheme evaluation model as tools to research the forklift scheduling scheme of one-stoery packed dangerous goods warehouse. Results: Optimal scheme and allocation decision model are obtained through numerical simulation. The innovation of this study is giving the safety formula of forklift operation in dangerous goods warehouse and using numerical simulation to obtain the global optimal solution. Furthermore, this study draws on the concept of travel chain to propose the idea of warehousing chain. At the same time, optimal schemes for multiple dangerous goods inbound and outbound the warehouse are studied. Conclusion: With the application of actual data in Shanghai Lingang dangerous goods warehouse, this study combines with the simulation technology to verify the allocation model of warehousing operations and forklift scheduling model. The validity and feasibility of the novel theory are also verified.

scholarly journals A time-optimal solution for the path cover problem on cographs

2003 ◽  
Vol 290 (3) ◽  
pp. 1541-1556 ◽  
Author(s):  
Koji Nakano ◽  
Stephan Olariu ◽  
Albert Y. Zomaya
Keyword(s):  
Optimal Solution ◽  
Path Cover ◽  
Time Optimal ◽  
Cover Problem

A Novel Algorithm for Time Optimal Trajectory Planning

2014 ◽  
Author(s):  
Mingxing Yuan ◽  
Bin Yao ◽  
Dedong Gao ◽  
Xiaocong Zhu ◽  
Qingfeng Wang
Keyword(s):  
Trajectory Planning ◽  
Optimal Trajectory ◽  
Optimal Solution ◽  
Problem Of Time ◽  
High Productivity ◽  
Hard Constraints ◽  
Time Optimal ◽  
Rate Optimization ◽  
Feed Rate Optimization ◽  
Optimal Trajectory Planning

Time optimal trajectory planning under various hard constraints plays a significant role in simultaneously meeting the requirements on high productivity and high accuracy in the fields of both machining tools and robotics. In this paper, the problem of time optimal trajectory planning is first formulated. A novel back and forward check algorithm is subsequently proposed to solve the minimum time feed-rate optimization problem. The basic idea of the algorithm is to search the feasible solution in the specified interval using the back or forward operations. Four lemmas are presented to illustrate the calculating procedure of optimal solution and the feasibility of the proposed algorithm. Both the elliptic curve and eight profile are used as case studies to verify the effectiveness of the proposed algorithm.

Supply Chain Coordination Under Service Level Constraint and Controllable Lead Time

2016 ◽  
Vol 7 (2) ◽  
pp. 84-106 ◽  
Author(s):  
Prashant Jindal ◽  
Anjana Solanki
Keyword(s):  
Supply Chain ◽  
Cost Reduction ◽  
Lead Time ◽  
Cost Allocation ◽  
Optimal Solution ◽  
Service Level ◽  
Decision Variable ◽  
Allocation Model ◽  
Controllable Lead Time ◽  
Ordering Cost Reduction

This paper investigates the coordination issue in a decentralized supply chain having a vendor and a buyer for a defective product. The authors develop two inventory models with controllable lead time under service level constraint. The first one is propose under decentralized mode based on the Stackelberg model, the other one is propose under centralized mode of the integrated supply chain. Ordering cost reduction is also including as a decision variable along with shipping quantity, lead time and number of shipments. Computational findings using the software Matlab 7.0 are provided to find the optimal solution. The results of numerical examples show that centralized mode is better than that of decentralized mode, and to induce both vendor and buyer for coordination, proposed cost allocation model is effective. The authors also numerically investigate the effects of backorder parameter on the optimal solutions. Benefit of ordering cost reduction in both models is also provided.

scholarly journals Performance Improvement on Nonorthogonal Multiple Access without CSIT

2020 ◽  
Vol 2020 ◽  
pp. 1-6 ◽  
Author(s):  
Wenlong Xia ◽  
Yuanping Zhou ◽  
Qingdang Meng
Keyword(s):  
Performance Improvement ◽  
Multiple Access ◽  
Euclidean Distance ◽  
Computational Cost ◽  
Optimal Solution ◽  
The Novel ◽  
Channel State ◽  
State Information ◽  
Virtual Channels ◽  
Constrained Capacity

In this paper, a downlink virtual-channel-optimization nonorthogonal multiple access (VNOMA) without channel state information at the transmitter (CSIT) is proposed. The novel idea is to construct multiple complex virtual channels by jointly adjusting the amplitudes and phases to maximize the minimum Euclidean distance (MED) among the superposed constellation points. The optimal solution is derived in the absence of CSIT. Considering practical communications with finite input constellations in which symbols are uniformly distributed, we resort to the sum constellation constrained capacity (CCC) to evaluate the performance. For MED criterion, the maximum likelihood (ML) decoder is expected at the receiver. To decrease the computational cost, we propose a reduced-complexity bitwise ML (RBML) decoder. Experimental results are presented to validate the superior of our proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document