A Simulation Based Study Of The Effect Of Truck Arrival Patterns On Truck Turn Time In Container Terminals

Author(s):  
Ahmed E. Azab ◽  
Amr B. Eltawil
2021 ◽  
Vol 11 (15) ◽  
pp. 6922
Author(s):  
Jeongmin Kim ◽  
Ellen J. Hong ◽  
Youngjee Yang ◽  
Kwang Ryel Ryu

In this paper, we claim that the operation schedule of automated stacking cranes (ASC) in the storage yard of automated container terminals can be built effectively and efficiently by using a crane dispatching policy, and propose a noisy optimization algorithm named N-RTS that can derive such a policy efficiently. To select a job for an ASC, our dispatching policy uses a multi-criteria scoring function to calculate the score of each candidate job using a weighted summation of the evaluations in those criteria. As the calculated score depends on the respective weights of these criteria, and thus a different weight vector gives rise to a different best candidate, a weight vector can be deemed as a policy. A good weight vector, or policy, can be found by a simulation-based search where a candidate policy is evaluated through a computationally expensive simulation of applying the policy to some operation scenarios. We may simplify the simulation to save time but at the cost of sacrificing the evaluation accuracy. N-RTS copes with this dilemma by maintaining a good balance between exploration and exploitation. Experimental results show that the policy derived by N-RTS outperforms other ASC scheduling methods. We also conducted additional experiments using some benchmark functions to validate the performance of N-RTS.


2013 ◽  
Vol 20 (Special-Issue) ◽  
pp. 32-46 ◽  
Author(s):  
Zhong-Zhen Yang ◽  
Gang Chen ◽  
Dong-Ping Song

Abstract Truck arrival management (TAM) has been recognized as an effective solution to alleviate the gate congestion at container terminals. To further utilize TAM in improving the overall terminal performance, this study integrates TAM with the other terminal operations at a tactical level. An integrated planning model and a sequential planning model are presented to coordinate the major terminal planning activities, including quayside berth allocation, yard storage space allocation and TAM. A heuristic-based genetic algorithm is developed to solve the models. A range of numerical examinations are performed to compare two planning models. The result shows that: the integrated model can improve the terminal performance significantly from the sequential model alone, particularly when the gate capacity and the yard capacity are relatively low; whereas the sequential model is more efficient than the integrated model in terms of computational time.


2018 ◽  
Vol 163 ◽  
pp. 288-298 ◽  
Author(s):  
P.E.N.G. Yun ◽  
L.I. Xiangda ◽  
W.A.N.G. Wenyuan ◽  
L.I.U. Ke ◽  
L.I. Chuan

2018 ◽  
Vol 9 (5) ◽  
pp. 354-358 ◽  
Author(s):  
Peng Yun ◽  
◽  
Wang Wenyuan ◽  
Zhang Qi ◽  
Chen Modi ◽  
...  

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ning Zhao ◽  
Mengjue Xia ◽  
Chao Mi ◽  
Zhicheng Bian ◽  
Jian Jin

Storage allocation of outbound containers is a key factor of the performance of container handling system in automated container terminals. Improper storage plans of outbound containers make QC waiting inevitable; hence, the vessel handling time will be lengthened. A simulation-based optimization method is proposed in this paper for the storage allocation problem of outbound containers in automated container terminals (SAPOBA). A simulation model is built up by Timed-Colored-Petri-Net (TCPN), used to evaluate the QC waiting time of storage plans. Two optimization approaches, based on Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), are proposed to form the complete simulation-based optimization method. Effectiveness of this method is verified by experiment, as the comparison of the two optimization approaches.


Sign in / Sign up

Export Citation Format

Share Document