In automated container terminals, effectively scheduling quay cranes (QCs), automated guided vehicles (AGVs), automated stacking cranes (ASCs) and AGV routing are two important problems. This paper studies the combinatorial optimization of two problems in the synchronous loading and unloading operation mode of the automated container terminal. First, a bi-level programming model for integrated scheduling problems is established with the goal of minimizing the completion time of all containers. Secondly, in order to solve the model, we design two bi-level optimization algorithms based on conflict resolution strategy: bi-level adaptive genetic algorithm based on conflict resolution strategy (CRS-BAGA) and bi-level genetic algorithm based on conflict resolution strategy (CRS-BGA). Finally, the effectiveness of the two optimization algorithms is verified by numerical experiments. Experimental results show that the proposed optimization algorithms are effective. They can coordinate the scheduling of three equipments and solve the conflict congestion problem of AGV.
Integrated scheduling in automated container terminals considering AGV conflict-free routing
Transportation Letters ; 13 , 7 ; 501-513
2021-08-09
13 pages
Article (Journal)
Electronic Resource
Unknown
Routing of AGVs on automated container terminals
IEEE | 2015
|Transportation Research Record | 2023
|Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal
British Library Online Contents | 2018
|Scheduling of Different Automated Yard Crane Systems at Container Terminals
Online Contents | 2017
|