区域航运网络上的不定期船舶调度优化  

Optimization of tramp ship scheduling on regional shipping network

作　　者：郑红星 任亚群 王泉慧 Zheng Hongxing;Ren Yaqun;Wang Quanhui(Transportation Engineering College, Dalian Maritime University, Dalian 116026)

机构地区：[1]大连海事大学交通运输工程学院

出　　处：《高技术通讯》2019年第6期614-624,共11页Chinese High Technology Letters

基　　金：国家自然科学基金(71473024)资助项目

摘　　要：为降低在区域航运网络上提供不定期货运服务的航运企业运营成本,本文研究了不定期船舶的调度优化。以区域内不同港口间货运需求已知为前提,重点考虑泊位时间窗和每个港口可装可卸的实际情况,兼顾港口的货物服务时间窗和船舶容量等现实约束,以计划期内所有调度船舶的总运营成本最小为目标,构建了一个整数规划模型,设计了嵌入禁忌搜索规则的遗传算法对模型进行求解,给出了所有船舶的挂靠港次序和运输的货物。通过数值实验,将改进遗传算法与CPLEX和传统遗传算法对比,验证了模型和算法的有效性。结果表明,考虑泊位时间窗和港口可装可卸能够降低运营成本。In order to reduce the operating cost of shipping enterprises providing irregular freight service on regional shipping network, the scheduling optimization of tramp ships is studied. Based on the premise that the freight requirements of different ports in the region are known, the time window of berths and the actual conditions of loading and unloading in each port are focused on, considering the realistic constraints such as the time window of cargo service of the port and ship capacity, an integer programming model is built to minimize the total operating costs of all dispatched ships during the planning period. A genetic algorithm embedded with tabu search rules is designed to solve the model. The order of the ports of call and the cargo transported by all ships are given. The improved genetic algorithm is compared with CPLEX and traditional genetic algorithm to verify the validities of the model and algorithm. The results show that considering the berth time window and loading and unloading in each port can reduce operating costs.

关 键 词：水路运输 船舶调度 改进遗传算法 不定期船舶 泊位时间窗 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] U692.4[自动化与计算机技术—控制科学与工程]