Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information

Guo, Xi; Huang, Shell Ying; Hsu, Wen Jing; Low, Malcolm Yoke Hean

doi:10.1016/j.aei.2011.02.002

Cited by 70 publications

(49 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…When designing a YC dispatching algorithm, many previous works assume that the YC service times for vehicle jobs are constant ( [1], [3], [7], [11]). This is correct when the container to be retrieved or stored is on the top of the container stack in the yard.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals

Huang

Guo

2013

Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation

Self Cite

View full text Add to dashboard Cite

Embedding simulation in optimization algorithms will incur computational costs. For NP-hard problems the computational costs of the embedded simulation in the optimization algorithm are likely to be substantial. YC dispatching is NP-hard. So it is very important to be able to minimize simulation costs in YC dispatching algorithms. In the optimization algorithm for yard crane dispatching published, simulation of YC operations of the entire (partial) sequence of YC jobs are carried out each time the tardiness of a (partial) sequence needs to be evaluated. In this paper we study two approaches to reduce simulation costs in these embedded simulations in the optimization algorithm. Experimental results show that one approach significantly reduces the computational time of the optimization algorithm. We also analyze the reasons for the other approach which fails to reduce the computational time.

show abstract

Section: Introductionmentioning

confidence: 99%

“…On the other hand, heuristics cannot guarantee optimal solutions. Guo et al [3] applied A* search to compute optimal single YC dispatching sequence based on vehicle arrival times to minimize vehicle waiting times.…”

Section: Introductionmentioning

confidence: 99%

Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals

Huang

Guo

2013

Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Meisel presented a unified approach for evaluating the performance of different quay crane scheduling model classes and solution procedures [2]. Guo focuses on the optimal sequencing of a yard crane for serving a fleet of vehicles for delivery and pickup jobs [3].…”

Section: Introductionmentioning

confidence: 99%

A generalized computational model for container terminal logistics systems with the perspective of multiprocessor system-on-chip

Yang

2013

2013 IEEE International Conference of IEEE Region 10 (TENCON 2013)

View full text Add to dashboard Cite

The systematic solution to integral scheduling for container terminal logistics systems (CTLS) has been scarce for their high complexity and randomness. In this paper, a generalized computational model for CTLS is presented. That considers the problem from the comparability between CTLS and multi-processor system-on-chip (MPSoC), and then gives definitions of the generalized computation, unified instruction set architecture and generalized computational instruction set for CTLS with the insights into MPSoC. Subsequently it focuses on the asynchronous concurrent computational model, parallel programming model and task scheduling model for CTLS to form a self-contained decision-making perspective and architecture. Finally, the approach is demonstrated by a practical case on the large-scale CTLS to be valid and credible.

show abstract

“…Here, the single YC dispatching algorithm at Level 3 may need to be called hundreds or even thousands of times to support decision making at Level 2. A modified A * search algorithm (Guo and Huang 2008;Guo et al 2009Guo et al , 2011 is employed to find the optimal dispatching solution for a YC in a zone over a period of time at Level 3. The modified A * algorithm is able to find the optimal solution from over 2 4 × 10 18 possible dispatching sequences within 3 seconds.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Space and Time Partitioning for Yard Crane Workload Management in Container Terminals

Guo

Huang

2012

Transportation Science

Self Cite

View full text Add to dashboard Cite

W e propose a new hierarchical scheme for yard crane (YC) workload management in container terminals.We also propose a time partitioning algorithm and a space partitioning algorithm for deploying YCs to handle changing job arrival patterns in a row of yard blocks. The main differences between our approach and most of the methods in literature are (1) the average vehicle job waiting time instead of the number of jobs is used to balance YC workload and to evaluate the quality of a partition, (2) the YC working zone assignment is not in units of yard blocks and our space partitioning algorithm generates more flexible divisions of the workload from all blocks, and (3) the YC deployment frequency is not fixed but is decided by our time partitioning algorithm with the objective of minimizing average vehicle waiting times. The scheme combines simulation and optimization to achieve our objective for a row of yard blocks. Experimental results show that the proposed binary partitioning algorithm TP2 makes substantial improvements in job waiting times over the basic partitioning scheme and another existing algorithm (Ng, W. C. 2005. Crane scheduling in container yards with intercrane interference. Eur. J. Oper. Res. 164(1) 64-78) in all tested job arrival scenarios.

show abstract

Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information

Cited by 70 publications

References 30 publications

Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals

Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals

A generalized computational model for container terminal logistics systems with the perspective of multiprocessor system-on-chip

Dynamic Space and Time Partitioning for Yard Crane Workload Management in Container Terminals

Contact Info

Product

Resources

About