基于挤压算法的集装箱码头泊位与岸桥联合调度优化

Extrusion algorithm-based optimization of berth and crane joint scheduling at container terminal

为获取合理的集装箱码头泊位-岸桥分配方案,基于连续泊位与岸桥联合调度问题,建立以最小化船舶在港时间和最大化岸桥利用率为目标的模型,并针对该模型设计了启发式算法——挤压算法,将泊位-岸桥联合调度看作二维装箱问题,通过挤压船舶在二维坐标图中的空隙来缩短船舶在港时间.算例分析表明,本文构建的模型和算法可有效缩短船舶在港时间,提高岸桥利用率.

In order to get reasonable distribution plan for berth-gantry cranes of the container terminal , this paper es-tablished an optimization model of the target ship to minimize the time in port and maximize the utilization of quay crane based on continuous berths and gantry cranes coordinated scheduling problem .And according to the model , this paper designed a heuristic algorithm - extrusion algorithm , which regarded berth-crane coordinated scheduling problem as a two-dimensional packing problem .And it did this by squeezing the ship in the gap in the two-dimensional plot to shorten the time of the vessels in the harbor. Example analysis shows that the model and algorithm constructed in this paper can effec-tively shorten the time of the ship in the harbor , so as to im-prove the utilization of quay crane .