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

摘要

In order to achieve the minimum number of Yard Truck ( YT) and the shortest delay time in the problem of YT scheduling of container terminals, an innovative optimization method using multidisciplinary variable coupling is presented. Firstly, the problem is divided into YT distribution problem and YT configuration problem, and the YT dispatching sub-model and YT configuration sub-model are established respectively. The two sub models are linked through the common design variables, and the YT coordinated scheduling coupling model based on quay crane job scheduling and time-window constraint is built with setting the iteration conditions. Finally, the coupling model is used to solve certain examples, using C# language calling CPLEX12.2, and the optimal YT num-ber and the coordinated scheduling scheme for multiple operation routes are obtained. The scheme has good convergence. The results show that the presented scheme can decrease the number of YT by 7.69% and reduce the total delay time by 10.12%, compared with using YT dispatching model and YT configuration model respectively, which indicates the effectiveness and practicality of the new scheme.%针对集装箱码头集卡调度问题，目的为使集卡数最小且延误时间最短。创新性的采用多学科变量耦合优化设计方法，将该问题分为集卡运输方式问题和集卡数量配置问题，分别建立集卡分派子模型和集卡配置子模型，使用公用设计变量连接模型，设定迭代计算条件建立基于岸桥作业并考虑时间窗约束的集卡协调调度耦合模型。利用该耦合模型应用C#语言调用CPLEX12.2对算例进行求解，得到面向多作业路的最优集卡数量和协调调度方案，方案具有良好的收敛性。结果表明，与分别采用集卡调度模型和配置模型比集卡数降低7.69%，总延误时间降低10.12%，说明该模型的有效性和实用性。