This study proposes a new approach to determine the dispatching rules of AGVs and container storage locations, considering both unloading and loading processes simultaneously. We formulate this problem as a mixed integer programming model, aiming to minimise the ship’s berth time. Optimal solutions can be obtained in small sizes, however, large-sized problems are hard to solve optimally in a reasonable time. Therefore, a heuristic method, i.e. genetic algorithm is designed to solve the problem in large sizes. A series of numerical experiments are carried out to evaluate the effectiveness of the integration approach and algorithm.
|Transportation Research Part E: Logistics and Transportation Review
|Published - 2015
Bibliographical noteNOTICE: this is the author’s version of a work that was accepted for publication in Transportation Research Part E: Logistics and Transportation Review. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Transportation Research Part E: Logistics and Transportation Review [Vol 79 (2015)] DOI: 10.1016/j.tre.2015.03.006 .
- container terminal operations
- automated container terminal
- container storage