期刊文献+

最小化集装箱运输成本的配载优化 被引量:6

Study on Stowage Optimization in Minimum Container Transportation Cost
下载PDF
导出
摘要 随着长江沿岸港口集装箱运输的快速发展,配载计划的制定已成为制约集装箱运输发展的一个主要因素。以航行中最小化的翻箱费用和堆栈使用费用为优化目标,在船舶安全航行的前提下,以船舶装载稳定性作为约束条件建立混合整数规划模型。通过CPLEX、遗传算法和贪婪算法对长江沿岸中小型集装箱船舶配载进行实验对比分析,结果证明了所提模型的有效性。同时,应用两种算法对大规模集装箱配载情形进行对比求解,通过仿真实验证明了遗传算法的高效性,与实际运输经验操作相比,其将运输成本平均降低了24.73%。这说明本文所提出的模型对于降低航线运输成本和制定长江沿岸港口配载计划具有一定的指导意义。 With the rapid development of container transportation along the Yangtze River,the stowage planning has become an important issue in the development of container transportation.Aiming at the minimum shifting cost and stack usage cost during the voyage,this paper established a mixed integer programming model that considers the ship safety and loading stability constraints.Then CPLEX,genetic algorithm and greedy algorithm were designed to analyze the stowage planning of small and medium sized container ships along the Yangtze River,and the validity of the proposed model was proved.Besides,the two proposed algorithms were applied to solve the large-scale container loading problem,and both of them can quickly get reasonable solutions.Compared with the industry experience,the experiments prove that the proposed model can reduce 24.73%on average for the transportation cost of the route and is of certain guiding significance to the container transportation along the Yangtze River.
作者 郑斐峰 蒋娟 梅启煌 ZHENG Fei-feng;JIANG Juan;MEI Qi-huang(Glorious Sun School of Business and Management,Donghua University,Shanghai 200051,China)
出处 《计算机科学》 CSCD 北大核心 2019年第6期239-245,共7页 Computer Science
基金 国家自然科学基金(71771048) 上海市人才发展资金资助项目(201471) 中央高校基本科研业务专项资金项目(2232018H-07)资助
关键词 配载优划 多港口 混合整数规划 遗传算法 贪婪算法 Stowage optimization Multiple ports Mixed integer programming Genetic algorithm Greedy algorithm
  • 相关文献

参考文献6

二级参考文献31

  • 1孔宪庶,蔡洪学.简单多边形凸包的双动线检测算法[J].计算机学报,1994,17(8):596-600. 被引量:18
  • 2周培德,卢开澄.计算几何--算法分析与设计[M].2版.北京:清华大学出版社,2005.
  • 3Lee D T.On finding the convex hull of a simple polygon[J].Int J Computing Info, 1983,12(2) :87-98.
  • 4Bronnimann H,Iacono J.Space-efficient planar convex hull algorithms[J].Theoretical Computer Science, 2004,321 ( 1 ) : 25-40.
  • 5M. Avriel, M. Penn. Exact and approximate solutions of the container ship stowage problem[J]. Computer & Industrial Engineering, 1993,25(1-4):271-274
  • 6M. Avriel, M. Penn, N. Shpirer, S. Witteboon. Stowage planning for container ships to reduce the number of shifts[J]. Annals of Operations Research, 1998,76: 55-71
  • 7M. Avriel, N. Shpirer, M. Penn. Container ship stowage problem: complexity and connection to the coloring of circle [J]. Discrete Applied Mathematics, 2000, 103(1-3)
  • 8I.D.Wilson, P.A.Roach. Principle of combinatorial optimization applied to container-ship stowage planning[J]. Journal of Heuristics, 1999,5: 403-418
  • 9I. D. Wilson, P. A. Roach, J. A. Ware. Container stowage pre-planning: using search to generate solutions, a case study[J]. Knowledge-Based System, 2001,14(3-4):137-145
  • 10D. K. Scott, D. S, Chen. A loading model for a container ship. Maston Navigation Company, Los Angeles, 1978

共引文献29

同被引文献73

引证文献6

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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