Abstract
ABSTRACT 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
