基于惩罚函数的集装箱码头连续泊位-岸桥联合调度

Unified Scheduling for Continuous Berth and Quay-Crane Based on Penalty Function

为对连续泊位与岸桥联合调度问题进行求解,从码头运营者的角度出发,以最小化惩罚为优化目标建立数学模型,设计一种嵌套式遗传算法。在客户满意率最大的情况下,求得船舶的靠、离泊时间和位置及最优装卸序列。通过进行数值模拟案例分析,验证该优化方法可在提高客户满意率的同时,缩短船舶在港时间,对集装箱码头生产运作实践具有一定的参考价值。

An optimization method of unified scheduling for continuous berth and quay-crane is formulated to minimize the punishment from the terminal operators＇ perspective, and a nested genetic algorithm is designed to solve this problem. The time of docking and departure, berthing and the best loading/unloading sequence of ships are solved for the highest custom- er satisfaction rate. The optimization method is verified with a representative case, which indicates that the method can im- prove the degree of customer satisfaction as well as decrease the birthing time of ships. The method can be a reference of some kind for the actual production of the container terminal.