期刊文献+

基于混合航线结构的集装箱航线与空重箱运输综合优化模型 被引量:23

Optimization model for container ship routing and empty/full container transport in the context of mixed route structure
原文传递
导出
摘要 基于混合航线结构,构建双层规划模型,优化集装箱航线与空重箱运输方案.基于遗传算法与线性规划优化算法开发改进的遗传算法求解模型.模型以航线收益最大为目标,同时确定干线靠泊港、干线港靠泊顺序、支线港以及空重箱运输方案.对某班轮公司亚欧航线的优化结果显示:若用4000TEU船型,需投入9艘船舶,航线的运营收益为每周19.56万美元;而若用10000TEU船型,需投入7艘船舶,航线运营收益为每周31.35万美元.另外,对比两类船型的航线方案可以看出,随着使用船舶的大型化,轴辐式与环绕式航线成为航线主流结构,这与航运市场的实际情况相符. A novel model was built to optimize the container ship routing and empty/full containers trans- port under the mixed route structure. With the objective to maximize the profit, the model determined the calling ports of a trunk line, calling sequence, feeder ports and transport plan of the empty/full containers. A new algorithm which combined genetic algorithm and linear programing algorithm was developed to solve the model. The optimization results of a company's Asia-Europe route show that if the route is operated by 4000-TEU ships, 9 ships are needed and the profit of the carrier is 195.6 thousands USD per week, while if 10000-TEU ships are selected, 7 ships will be deployed and the profit is 313.5 thousands USD. In addition, by comparing the above two shipping schemes with different ship types, it demonstrates that with the use of larger ships, the hub-spoke and multi-port route structures will be the main routing pattern, which is consistent with the actual situation of the shipping market.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2014年第1期122-128,共7页 Systems Engineering-Theory & Practice
基金 教育部博士点基金(20112125110003) 中央高校基本科研业务费专项基金(2012QN074 3132013078) 国家自然科学基金(71302044)
关键词 班轮航线优化 空重箱运输 航线结构 遗传算法 线性规划 ship routing empty/full containers route structure genetic algorithm linear programming
  • 相关文献

参考文献10

  • 1Ronen D. Cargo ships routing and scheduling:Survey of models and problems[J].European Journal of Operational Research,1983.119-126.
  • 2Ronen D. Ship scheduling:The last decade[J].European Journal of Operational Research,1993.325-333.
  • 3Christiansen M,Fagerholt K,Ronen D. Ship routing and scheduling:Status and perspective[J].Transportation Science,2004,(01):1-18.
  • 4Imai A,Shintani K,Papadimitriou S. Multi-port vs hub-and-spoke port calls by containerships[J].Transportation Research Part E:Logistics and Transportation Review,2009.740-757.
  • 5Chen C,Zeng Q C. Design container shipping network under changing demand and freight rates[J].Transport,2010,(01):46-57.
  • 6Shintani K,Imai A,Nishimura E. The container shipping network design problem with empty container repositioning[J].Transportation Research Part E:Logistics and Transportation Review,2007.39-59.
  • 7Meng Q,Wang S. Liner shipping service network design with empty container repositioning[J].Transportation Research Part E:Logistics and Transportation Review,2001.695-708.
  • 8寿涌毅,赖昌涛,吕如福.班轮船舶调度多目标优化模型与蚁群算法[J].交通运输工程学报,2011,11(4):84-88. 被引量:15
  • 9谢新连,李树范,纪卓尚,成■复.船队规划的线性模型研究与应用[J].中国造船,1989,30(3):61-68. 被引量:28
  • 10孙海雷,刘琼荪,胡上尉.TSP问题的顺序插入交叉算子[J].计算机工程与应用,2007,43(8):65-66. 被引量:8

二级参考文献20

  • 1李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究[J].管理工程学报,2006,20(4):9-12. 被引量:10
  • 2CHRISTIANSEN M, FAGERHOLT K, RONEN D. Ship routing and scheduling: status and perspectives[J]. Transportation Science, 2004, 38(1): 1-18.
  • 3DANIEL A. Routing andscheduling with time windows: models and algorithms for tramp sea cargos and rail car blocks[D]. Atlanta: Georgia Institute of Technology, 2006.
  • 4TINGS C, TZENG G H. Ship scheduling and cost analysis for route planning in liner ahipping[J]. Maritime Economics and Logistics, 2008, 5(4): 378-392.
  • 5A.GARWAL R, ERGUN O. Skip scheduling artd network design for cargo routing in liner shipping [J]. Transportation Science, 2008, 42(2) : 175-196.
  • 6YAN Shang-yao, CHEN C Y, LIN S C. Ship scheduling and container shipment planning for liners in short-term operations[J]. Journal of Marine Science and Technology, 2009, 14(4) : 417-435.
  • 7DORIGO M, DI CARO G, GAMBARDELLA L M. Ant algorithms for discrete optimization[J]. Artificial Life, 1999, 5(2): 137-172.
  • 8CHIRA C, PINTEA C M, DUMITRESCU D. An agent- based approach to combinatorial optimization[J]. International Journal of Computers, Communications and Control, 2008, 3(S): 212-217.
  • 9DORIGO M, BLUM C. Ant colony optimization theory: a survey[J]. Theoretical Computer Science, 2005, 344 (2/3) : 243-278.
  • 10KOLISCH R, DREXL A. Local search for nonpreemptive multi-mode resource-constrained project scheduling[J]. IIE Transactions, 1997, 29(11): 987-999.

共引文献44

同被引文献218

引证文献23

二级引证文献150

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部