全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

集装箱船舶支线运输航线优化算法

, PP. 68-75

Keywords: 集装箱运输,航线设计,轴-辐式网络,整数规划,遗传算法,方差分析

Full-Text   Cite this paper   Add to My Lib

Abstract:

以枢纽港船舶限制时间和支线船舶容量为基础,分析了轴-辐式网络运输模式。以船舶最小总航行时间为目标函数,建立了混合整数规划支线集装箱运输模型。通过设计巡回路线方法实现杂交和变异,更新了解的构成,运用遗传算法求解模型。计算结果表明当船舶容量为150TEU时,在160次迭代后,总航行时间为708.6h,航线数量为8条;当船舶容量分别为100、150TEU时,在150次迭代后,总航行时间为714.6h,航线数量为9条;对枢纽港船舶限制时间和支线船舶容量进行方差分析,F检验统计量的概率值均明显小于0.05;对支线船舶容量和运营成本进行敏感性分析,增大船舶容量能够减小航线数量和运行时间,但增大了运营成本,增大枢纽港船舶限制时间能够减小航线数量;考虑航行时间和运营成本,当船舶容量为150TEU时最合理。

References

[1]  CHRISTIANSEN M, FAGERHOLT K, FLATBERG T, et al. Maritime inventory routing with multiple products: a case study from the cement industry[J]. European Journal of Operational Research, 2011, 208(1): 86-94.
[2]  FAGERHOLT K. Ship scheduling with soft time windows: an optimization based approach[J]. European Journal of Operational Research, 2011, 131(3): 559-571.
[3]  BRONMO G, CHRISTIANSEN M, FAGERHOLT K, et al. A multi-start local search heuristic for ship scheduling―a computational study[J]. Computer and Operations Research, 2007, 34(3): 900-917.
[4]  PANG K W, XU Zhou, LI C L. Ship routing problem with berthing time clash avoidance constraints[J]. International Journal of Production Economics, 2011, 131(2): 752-762.
[5]  KOSMAS O T, VIACHOS D S. Simulated annealing for optimal ship routing[J]. Computers and Operations Research, 2008, 35(3): 576-581.
[6]  KIM K Y, KIM K H. A routing algorithm for a single straddle carrier to load export containers onto a containership[J]. International Journal of Production Economics, 1999, 59(1/2/3): 425-433.
[7]  NISHIMURA E, IMAI A, JANSSENS G K, et al. Container storage and transshipment marine terminals[J]. Transportation Research Part E: Logistics and Transportation Review, 2009, 45(5): 771-786.
[8]  MENG Qiang, WANG S. Liner shipping service network design with empty container repositioning[J]. Transportation Research Part E: Logistics and Transportation Review, 2011, 47(5): 695-708.
[9]  HSU C I, HSIEH Y P. Routing ship size and sailing frequency decision-making for a maritime hub-and-spoke container network[J]. Mathematical and Computer Modelling, 2007, 45(7/8): 899-916.
[10]  KARLAFTIS M G, KEPAPTSOGLOU K, SAMBRACOS E. Containership routing with time deadlines and simultaneous deliveries and pick-ups[J]. Transportation Research Part E: Logistics and Transportation Review, 2009, 45(1): 210-221.
[11]  GELAREH S, NICHEL S, PISINGER D. Liner shipping hub network design in a competitive environment[J]. Transportation Research Part E: Logistics and Transportation Review, 2010, 46(6): 991-1004.
[12]  靳志宏,胡 杰,杨永志.集装箱支线运输航次调度优化[J].大连海事大学学报,2009,35(3):32-36. JIN Zhi-hong, HU Jie, YANG Yong-zhi. Optimization on voyage scheduling for container feeder lines[J]. Journal of Dalian Maritime University, 2009, 35(3): 32-36.(in Chinese)
[13]  靳志宏,解玉真,李 阳,等.集装箱支线运输船舶调度优化问题[J].中国航海,2008,31(4):415-419. JIN Zhi-hong, XIE Yu-zhen, LI Yang, et al. Scheduling optimization problems of feeder line container ships[J]. Navigation of China, 2008, 31(4): 415-419.(in Chinese)
[14]  JEON G, LEEP H R, SHIM J Y. A vehicle routing problem solved by using a hybird genetic algorithm[J]. Computer and Industrial Engineering, 2007, 53(4): 680-692.
[15]  BAKER B M, AYECHEW M A. A genetic algorithm for the vehicle routing problem[J]. Computer and Operations Research, 2003, 30(4): 787-800.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133