摘要
对集装箱码头上出口箱的装载作业调度控制直接影响码头的整体运营效率。研究了多台场吊的装载作业序列调度问题,同时考虑场吊在不同箱区之间的转场和在单个箱区内的作业序列调度。提出了一个混合整数规划模型对问题进行建模,并定义了场吊作业时的碰撞和跨越干涉约束。该问题为NP-hard问题,因此开发设计了遗传算法对问题进行求解,并提出了一个问题低界求解算法对遗传算法进行评价。实验研究证明算法能有效地解决该问题。
The efficiency of yard crane scheduling is critical in increasing the throughput of a maritime terminal. The problem of scheduling multiple yard cranes in loading operations was studied. The deployment of yard cranes among container blocks and the sequencing of yard cranes within each block were considered at the same time. A mixed integer programming model was developed to formulate the problem with crane collision and cross interference constraints. A genetic algorithm was proposed to obtain near optimal solutions. A lower bound procedure was developed to evaluate the performance of the algorithm. Experimental tests show that the algorithm can solve the problem efficiently.
出处
《工业工程与管理》
CSSCI
北大核心
2017年第4期100-106,114,共8页
Industrial Engineering and Management
基金
智能制造装备发展专项资助项目(2014-2015)
关键词
集装箱码头
调度
混合整数规划
遗传算法
低界
container terminal
scheduling
mixed integer programming
genetic algorithm
lower bound
