计算机科学
容器(类型理论)
块(置换群论)
调度(生产过程)
接头(建筑物)
运筹学
数学优化
工程类
数学
土木工程
机械工程
几何学
作者
Hongtao Hu,Xiazhong Chen,Lu Zhen,Chengle Ma,Xiaotian Zhang
标识
DOI:10.1093/imaman/dpy013
摘要
A container terminal is a complex system in which the makespan of a ship service depends not only on the operations of quay cranes (QCs) but also on the operations of yard cranes (YCs) and the horizontal transportation by trucks. This paper addresses the joint QC schedule and block allocation of YCs in container terminals. We determine the QC scheduling by considering the handling capacity and storage capacity of yard blocks as well as the travel time of trucks. A mixed-integer linear programming model is formulated to minimize the makespan of a ship service and the travel time of trucks. A hybrid Particle Swarm Optimization (PSO) algorithm that incorporates a neighbourhood search with a taboo list and heuristic preprocessing is proposed to improve the solution and CPU runtime. Numerical experiments are performed to validate the correctness of the proposed models and the efficiency of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI