时间窗下单船岸桥调度——基于数学规划和规则的启发式算法

Shore-mounted gantry crane scheduling for single vessel under time window——using mathematical programming and rule heuristic algorithm

在考虑任务属性中的任务优先顺序和不可同时执行要求,岸桥属性中的岸桥时间窗、转移时间、初始位置、安全距离和装卸速度等因素下,以单艘船舶的最短岸桥作业时间为目标函数,建立单艘船舶岸桥调度的混合整数线性模型P1。计算数据采集于宁波某集装箱港口,通过简化模型P2求解岸桥调度模型P1的下限边界值和排程数据,在此基础上,运用基于规则的启发式算法求解模型P1的岸桥调度时序表。计算结果表示本组合算法能较好地得到满意解,而且比较符合港口实际。

Considering task priority and impossible parallel execution in task attribute and time window, shore-mounted gantry crane or Quay Crane（QC）transfer time, QC initial position, QC’s safe separation distance and loading and unloading velocity in QC attributes, this paper establishes QC scheduling MILP model P1 with the objective of the shortest operation time, and the solution is gotten based on the data from a container terminal in Ningbo, China. In order to get more practical solution, this paper sets up a simplified model P2 to get the lower limit of P1. The rule based heuristic algorithm is used to solve P1. The result states this combination method can be used to get the optimal and more practical solution.