期刊文献+

集装箱码头泊位调度问题的启发式算法研究 被引量:4

A Heuristic Algorithm for Berth Scheduling Problem in Container Ports
下载PDF
导出
摘要 为优化集装箱码头泊位的分配,提高泊位的利用率,把码头泊位的调度问题转化为带有约束条件的特殊二维装箱问题。通过建立连续泊位调度的非线性规划模型,提出了一种求解集装箱码头连续泊位分配问题启发式算法。仿真算例结果表明该算法能在实际的集装箱码头泊位调度中有效的提高泊位的利用率。 For improving the utilization of berths,in this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation results show that the algorithm can improve the utilization of berths on berth scheduling in the container port.
出处 《青岛大学学报(工程技术版)》 CAS 2010年第4期57-60,70,共5页 Journal of Qingdao University(Engineering & Technology Edition)
基金 国家自然科学基金项目(70671057) 山东省自然科学基金项目(ZR2010GM006)
关键词 泊位分配 装箱问题 启发式算法 berth scheduling two-dimensional packing heuristic algorithm
  • 相关文献

参考文献10

  • 1Lim A. The Berth Planning Problem[J].Operations Research Letters, 1998, 22(2) : 105 - 110.
  • 2Lai K K, Shih K. A Study of Container Berth Allocation[J]. Journal of Advanced Transportation, 1992(26) : 45 - 60.
  • 3Imai A, Nagaiwa A, Tat C W. Efficient Planning of Berth Allocation for Container Terminals in Asia[J]. Journal of Advanced Transoortation, 1994(31): 75- 94.
  • 4Gordeau J F, Laporte G, Legato P, et al. Models and Tabu Search Heuristics for the Berth-Allocation Problem[J]. Transportation Science, 2005(39) : 526 - 538.
  • 5Kim K H, Moon K C. Berth Scheduling by Simulated Annealing[J]. Transportation Research Part B 37, 2003(37) : 541 - 560.
  • 6Imai A, Nishimura E,Papadimitriou S. The Dynamic Berth Allocation Problem for a Container Port[J]. Transportation Research Part B, 2001(35) : 401 - 417.
  • 7Imai A, Nishimura E, Papadimitriou S. Berth Allocation with Service Priority[J]. Tranportation Research Part B, 2003, 37(5) : 437 - 457.
  • 8Monoaca M F, Sammarra M. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangaen Approach [J]. Tranportation Science, 2007, 41(2) :265 - 280.
  • 9Hansen P, Mladenovic N. Variable Neighborhood Search for Minimum Cost Berth Allocation[J]. European Journal of Operational Research, 2008, 191(3) : 636 - 649.
  • 10George J A, Robinson D F. A Heuristic for Packing Boxes into a Container [J].Computers and Operations Research, 1980(7) : 147- 156.

同被引文献27

  • 1计明军,靳志宏.集装箱码头集卡与岸桥协调调度优化[J].复旦学报(自然科学版),2007,46(4):476-480. 被引量:47
  • 2蔡芸,张艳伟.集装箱码头泊位分配的仿真优化方法[J].中国工程机械学报,2006,4(2):228-232. 被引量:18
  • 3Imai, A. , Nishimura, E. , Papadimitriou, S.. The dynamic berth allocation problem for a container port[J]. Transportation Re- search Part B,2001,35(4) :401-417.
  • 4Imai, A. ,Nagaiwa,K. ,Tat,C. W.. Efficient planning of berth al- location for container terminals in Asia[J]. Journal of Advanced Transportation, 1997,31 (1) : 75-94.
  • 5张新艳,张煜,孙国正.基于虚拟实现的港口集装箱码头装卸仿真系统[C].中国工程机械学会2002年年会论文集,2002.
  • 6Liu,J. , Wan, Y. W. , Wang, L.. Quay crane scheduling at contain- er terminals to minimize the maximum relative tardiness of vessel departures[J].Naval Research Logistics,2006,53(1):60-74.
  • 7Christian Bierwirth,Frank Meisel. A survey of berth allocation and quay crane scheduling problems in container terminals[J].European Journal of Operational Research,2010.615-627.
  • 8Bierwirth C,Meisel F.A survey of berth allocation and quay crane scheduling problems in container terminals.European Journal of Operational Research,2010,202(3):615-627.
  • 9Lai K K,Shih K.A Study of container berth allocation.Journal of Advanced Transportation,1992,26(1):45-60.
  • 10Park YM,Kim KH.A scheduling method for berth and quay cranes.OR Spectrum,2003,25(1):1-23.

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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