连续泊位下泊位分配与岸桥动态调度的联合优化*

根据到港船舶的装卸作业量、最优靠泊位置,为了最小化船舶在港时间、提高客户满意度,对延迟完工的装卸任务量、与最佳靠泊位置的偏离程度设置不同级别的惩罚费用系数；同时为了充分利用岸桥资源,考虑岸桥可在船舶间移动装卸的动态调度,研究连续型泊位下泊位分配-岸桥动态调度的联合优化问题.建立了以最小化延迟完工任务量、偏离最佳靠泊位置和岸桥移动的惩罚费用为目标的整数规划模型,结果可得到船舶靠泊计划,以及具体的岸桥分派计划.通过算例验证了联合调度优化模型对提高集装箱码头作业效率和船公司客户满意度的有效性.

Coordinated optimization of continuous berth allocation and quay crane dynamic scheduling

To minimize the total time in harbor and improve customer satisfaction, different levels of punishment for the delay completion tasks and the deviation from the optimal berthing position are considered. To make full use of quay crane resources, dynamic scheduling of quay crane is taken into account and combined with continuous berth allocation simultaneously. An integer programming model is established to minimize the penalty costs of delay completion tasks, deviating from the optimal berthing location and quay crane movement. Berthing schedule and specific quay crane assignment plan can be gained. Experiments are carried out to verify the model, which show that the proposed approach can improve the efficiency of container terminals and the satisfaction of ship companies.