集装箱码头泊位、岸桥和集卡协同调度优化

Study on Coordinated Scheduling of Berths, Quay Cranes and Harbor Trucks at Container Terminals

针对集装箱码头泊位、岸桥和集卡的协同调度问题,考虑了船舶到港的先后顺序、实际操作过程中岸桥和集卡的相关约束,以物流作业总成本最低为目标,构建了一个数学模型。通过分析我国T集装箱码头实际操作过程中船舶待卸载集装箱量与分配的岸桥数量之间的关系,设置了一个常数k,对每艘船分配的岸桥数进行预处理,即每艘船分配的岸桥数等于船舶待卸载的集装箱数量与常数k的比值,将该模型转化为一个整数线性规划数学模型。然后以该码头的真实数据为算例,运用商业软件ILOG CPLEX进行求解,在可接受的时间内求得了最优解,并将求得的结果与实际操作过程进行对比,表明得到的最优解在实际操作过程中是可行的,验证了模型的有效性和准确性。

In this paper, we studied the coordination of the berths, quay cranes, and harbor trucks of a container terminal, considered the arrival order of the ships to the terminal and the related constraints in the practical operation of the quay cranes and container trucks, and established a mathematical model with the goal to minimize the total cost of the logistics operations. Then, through analyzing the relationship between the volume of the containers to be unloaded and the quay cranes allotted to their unloading in the actual operation of the container terminal T in China, we defined a constant k to express the number of quay cranes allocated per ship, that is, the number of quay cranes allotted to each ship equals the ratio between the number of the containers to be unloaded and the constant k, and converted this model into an integer linear programming model. Next, based on the actual data of the terminal, we used the commercial software ILOG CPLEX to obtain the optimal solution in an acceptably short period of time, and compared it with the actual operation process, showing that the optimal solution obtained was feasible in practice, thus verifying the validity and accuracy of the model.