考虑时间窗约束的集卡调度耦合模型及求解

发布时间：2018-04-08 20:08

本文选题：集装箱码头　切入点：集卡调度　出处：《广西大学学报(自然科学版)》2014年03期

【摘要】：针对集装箱码头集卡调度问题,目的为使集卡数最小且延误时间最短。创新性的采用多学科变量耦合优化设计方法,将该问题分为集卡运输方式问题和集卡数量配置问题,分别建立集卡分派子模型和集卡配置子模型,使用公用设计变量连接模型,设定迭代计算条件建立基于岸桥作业并考虑时间窗约束的集卡协调调度耦合模型。利用该耦合模型应用C#语言调用CPLEX12.2对算例进行求解,得到面向多作业路的最优集卡数量和协调调度方案,方案具有良好的收敛性。结果表明,与分别采用集卡调度模型和配置模型比集卡数降低7.69%,总延误时间降低10.12%,说明该模型的有效性和实用性。
[Abstract]:Aiming at the container terminal card collection scheduling problem, the aim is to minimize the number of cards and minimize the delay time.Innovative multi-disciplinary variable coupling optimization design method is used to divide the problem into the card transportation mode problem and the card quantity allocation problem. The sub-model of card dispatch and the sub-model of card configuration are established, and the common design variable connection model is used.The coupling model of coordinated scheduling based on shore bridge operation and time window constraints is established by setting up iterative calculation conditions.By using this coupling model, CPLEX12.2 is called by C # language to solve the example, and the optimal number of set cards and coordinated scheduling scheme for multi-job path are obtained, and the scheme has good convergence.The results show that the number of cards is reduced by 7.69 and the total delay time is reduced by 10.12 compared with the model of card scheduling and configuration, respectively, which shows the validity and practicability of the model.
【作者单位】：上海海事大学物流研究中心;
【基金】：国家自然科学基金资助项目(71071093) 上海市自然科学基金资助项目(10ZR1413300) 上海市教委创新基金资助项目(11YZ136) 上海市科委创新资助项目(09DZ2250400,9530708200,10190502500) 上海市重点学科资助项目(J50604)
【分类号】：U691.3

【参考文献】