Containership routing with time deadlines and simultaneous deliveries and pick-ups
Containership routing with time deadlines and simultaneous deliveries and pick-ups
复制标题
DOI：
10.1016/j.tre.2008.05.001
复制
发表时间：
2009
影响因子：
10.6
通讯作者：
M. Karlaftis;K. Kepaptsoglou;E. Sambracos
中科院分区：
文献类型：
--
作者：
M. Karlaftis;K. Kepaptsoglou;E. Sambracos
在本文中，我们试图确定最佳路线的集装箱船队执行皮卡和交付之间的枢纽和几个辐条港口。提出了一种基于混合遗传算法的集装箱船队路径规划方法，并求解了一个包含取件、交货和时限的容量约束车辆路径问题。算法的性能和方法的可行性的结果表明，一个相对较小的船队的集装箱船可以提供有效的服务期限内。此外，通过灵敏度分析，我们讨论了性能的鲁棒性和一致性的开发算法下的各种问题设置和参数值。
In this paper we seek to determine optimal routes for a containership fleet performing pick-ups and deliveries between a hub and several spoke ports. A capacitated vehicle routing problem with pick-ups, deliveries and time deadlines is formulated and solved using a hybrid genetic algorithm for establishing routes for a dedicated containership fleet. Results on the performance of the algorithm and the feasibility of the approach show that a relatively small fleet of containerships could provide efficient services within deadlines. Moreover, through sensitivity analysis we discuss performance robustness and consistency of the developed algorithm under a variety of problem settings and parameters values.