期刊文献+

集装箱码头泊位—岸桥分配耦合优化 被引量:17

Coupling optimization for berth allocation and quay crane assignment problem in container terminals
下载PDF
导出
摘要 针对现有泊位、岸桥分配优化方法因未考虑二者耦合关系引发的资源浪费或作业冲突等问题,以船舶作业时间为耦合变量,建立了基于泊位分配子模型和岸桥分配子模型的耦合模型,优化目标为最小化船舶在港时间和岸桥移动次数。提出了一种嵌套循环进化算法进行求解,其中,两个内循环分别用于求解泊位分配和岸桥分配子模型,外循环通过两个内循环的相互作用和反馈来寻找满意解。通过试验算例验证了所提耦合优化方法的有效性。 Existing optimized approaches for berth allocation and quay crane assignment problems didn't consider resource wastes or conflicts in operations caused by their coupling relationships.To solve this problem,by using ship handling time as coupling variables,a coupled model was established based on the berth allocation sub-model and the quay crane assignment sub-model.The objective of the coupled model was to minimize the waiting time of ships and the transfer number of quay cranes.An evolutionary algorithm with nested loops was presented.Two internal loops were used to solve the berth allocation sub-problem and the quay crane assignment sub-problem respectively.And with the interaction and feedback between the two loops,an external loop was adopted to find the satisfactory solution.The computational experiments were given to verify the effectiveness of the presented coupled approach.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2011年第10期2270-2277,共8页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(70972008)~~
关键词 耦合优化 泊位分配 岸桥分配 嵌套循环 集装箱码头 coupling optimization berth allocation quay crane assignment nested loop container terminals
  • 相关文献

参考文献14

  • 1BIERWIRTH C, MEISEL F. A survey of berth allocation and quay crane scheduling problems in container terminal[J]. European Journal of Operational Research, 2010, 202 ( 3 ): 615-627.
  • 2STEENKEN D, VOB S, STAHLBOCK R. Container terminal operation and operations research-a classification and literature review[J]. OR Spectrum,2004,26(1):3-49.
  • 3STAHLBOCK R, VOB S. Operations research at container terminals : a literature update[J]. OR Spectrum, 2008,30 (1) : 1-52.
  • 4GUAN Y, CHEUNG R K. The berth allocation problem: models and solution methods[J]. OR Spectrum, 2004,26 (1) : 75-92.
  • 5IMAI A, NISHIMURA E, HATTORI M, et al. Berth allocation at indented berths for mega-containerships[J]. European Journal of Operational Research,2007,179(2) : 579-593.
  • 6IMAI A, NISHIMURA E, PAPADIMITRIOU S. Berthing ships at a multi-user container terminal with a limited quay capacity[J]. Transportation Research Part E, 2008, 44 (1) 136-151.
  • 7CORDEAU J F, LAPORTE G, LEGATO P, et al. Models and tabu search heuristics for the berth-allocation problem[J].Transportation Science, 2005,39(4) : 526-538.
  • 8PARK Y M, KIM K H. A scheduling method for berth and quay cranes[J]. OR Spectrum, 2003,25 (1) : 1-23.
  • 9OGUZ C, BLAZEWICZ J, CHENG T C E, et al. Berth allocation as a moldable task scheduling problem[C]//Proceedings of the 9th International Workshop on Project Management and Scheduling ( PMS 2004 ). Nacy, France: LORIA, 2004: 201-205.
  • 10IMAI A, CHEN H C, NISHIMURA E, et al. The simultaneous berth and quay crane allocation problem[J]. Transportation Research Part E, 2008,44(5) : 900-920.

二级参考文献17

共引文献25

同被引文献153

引证文献17

二级引证文献67

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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