基于离散贝位的集装箱港口岸桥作业调度研究

主要研究了港口中最重要的设备——岸桥的调度问题。岸桥作业能力的好坏很大程度上影响着集装箱港口总的装卸能力。因此,如何合理的分配岸桥,改进岸桥装卸作业进程是港口岸桥问题研究的重点。将岸桥移动时间以及安全系数和非干扰等因素全部考虑在内,先以岸桥作业时间最小为目的,建立模型,得到岸桥的优化作业线路。在此基础上,以船舶服务时间最短为目标,提出了一个基于离散贝位的岸桥调度混合整数规划模型。目的是使停靠在港口的船舶上的所有集装箱的装卸作业时的服务时间达到最小。最后,算例验证了模型的有效性。

Quay Crane Scheduling Problem at Container Terminal Based on Non-contiguous Bay

This paper discusses the problem of scheduling quay cranes(QCs),the most important equipment in port terminals.Its productivity greatly affects the efficiency of the terminal.Consequently,the key of the quay crane scheduling problem(QCSP) is to find a reasonable assignment of the available quay crane to ships and improve the loading and unloading operations.By considering various constraints related to the operation of QCs,we formulate a model to obtain the optimal route of quay cranes.And then a mixed-integer programming model which was base on non-contiguous bay,was formulated.The quay crane scheduling problem(QCSP) aims at pursuing the minimization of the vessel’service time(makespan).At last,the performance of numerical experiment proves the effectiveness of the model.