期刊文献+

基于时间不确定的集装箱码头靠泊计划优化 被引量:8

A Simulation-based Optimization Approach to Container Terminal Berth Planning Under Time Uncertainty
下载PDF
导出
摘要 集装箱班轮运输具有较强的计划性,但在实际中,由于天气等原因仍存在运行时间不确定性,对制定靠泊计划产生重要影响.针对这一问题,研究集装箱班轮运行时间的偏差规律;根据问题特点和集装箱班轮靠泊规则,构建基于运行时间不确定的集装箱码头靠泊计划优化模型;设计以遗传算法为外层框架,嵌入仿真过程构成优化循环的算法,针对问题特点设计初始择优策略进行求解.最后,以大连港集装箱码头作业为实际背景进行建模和计算,取得了较好的结果.实例分析和算法测试证明了本文所建模型和算法的有效性. Although container liner shipping has strict planning regulations,there are still uncertainties in practical operations due to weather and other reasons,which have a significant impact on the container terminal berth planning.In response to this problem,this paper investigates the deviation rule of the operation law of container liners and constructs a berth planning optimization model based on the operation time uncertainty.A solution algorithm is designed,in which a genetic algorithm is applied as the outer framework and the simulation process is embedded.According to the characteristics of the problem,an initial population generation strategy is designed to facilitate the solution algorithm.Finally,a case study based on the Dalian port container terminal is carried out to optimize the berth planning under uncertain time.Case results verify the effectiveness of the model and algorithm.
作者 宋云婷 王诺 SONG Yun-ting;WANG Nuo(School of Transportation Engineering,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2020年第4期224-230,共7页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(71872025).
关键词 水路运输 集装箱班轮 规律 概率分布 仿真 waterway transportation container shipping rules probability distribution simulation
  • 相关文献

参考文献2

二级参考文献19

  • 1焦海贤,郭新.内河港口系统模拟模型研究[J].中国管理科学,1993,1(2):39-48. 被引量:2
  • 2Frank Meisel, Christian Bierwirth. A survey of berth allocation and quay crane scheduling problems in container terminals[ J]. European Journal of Operational Research, 2010, (202) : 615- 627.
  • 3Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. The dynamic berth allocation problem for a container port[ J]. Transpor- tation Research Part E, 2001, (35) : 401-417.
  • 4Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation with service priority[ J]. Transportation Research Part B, 2003, (37) : 437-457.
  • 5Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos Papadimitriou. Berth allocation at indented berths for mega-container- ships[ J]. European Journal of Operational Research, 2007, (179) : 579-593.
  • 6Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berthing ships at a multi-user container terminal with a limited quay ca- pacity[ J ]. Transportation Research Part E, 2008, (44) : 136-151.
  • 7Der-Horng Lee, Jiang Hang Chen, Jin Xin Cao. The continuous berth allocation problem: a greedy randomized adaptive search solution[ J]. Transportation Research Part E, 2010, (46) : 1017-1029.
  • 8Akio Imai, Xin Sun, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation in a container port: Using a continuous loca- tion space approach[ J]. Transportation Research Part B, 2005, (39) : 199-221.
  • 9R Tavakkoli - Moghaddam, Makui, Salahi, Bazzazi. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports[ J]. Computers & Industrial Engineering, 2009, (56) : 241-248.
  • 10Frank Meisel, Christian Bierwirth. Heuristics for the integration of crane productivity in the berth allocation problem [ j]. Transportation Research Part E, 2009, (45) : 196-209.

共引文献17

同被引文献55

引证文献8

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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