期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

集装箱码头连续泊位动态分配优化模型及算法 被引量：2

Dynamic Allocation Optimized Model and Calculation of Continuous Berth at Container Terminal
下载PDF
导出
摘要 以泊位配置问题为研究对象,以到港船舶总在港时间最短为目标,建立优化模型。设计了基于Q学习方法的优化算法,并以某集装箱码头的实际船舶作业数据为例,对模型及算法的有效性进行了验证。 Taking berth allocation for study,optimized model is established by aiming at the shortest total round period of vessels arriving at the port.Optimized calculation based on Q study method is designed.Taking the actual vessel working data of certain container terminal for example,the effectiveness of model and calculation is verified.
作者 张佳运 卢刚
机构地区 辽宁省交通工程质量与安全监督局 丹东市交通工程质量与安全监督处
出处 《北方交通》 2011年第4期127-128,共2页 Northern Communications
关键词 集装箱码头 泊位分配 Q学习算法 Container terminal Berth allocation Q study calculation
分类号 U653.2 [交通运输工程—港口、海岸及近海工程]
  • 相关文献

参考文献3

二级参考文献8

  • 1[1]IMAI A,NAGAIWA K,CHAN W T.Efficient planning of berth allocation for container terminals in Asia[J].Journal of Advanced Transportation,1997,31:75-94.
  • 2[2]IMAI A,NISHIMURA E,PAPADIMITRIOU S.The dynamic berth allocation problem for a container port[J].Transportation Research,2001,B 35:401-417.
  • 3[3]IMAI A,NISHIMURA E.Berth allocation with service priority[J].Transportation Research,2003,Part B 37:437-457.
  • 4[4]NISHIMURA E,IMAI A.Berth allocation planning in the public berth system by genetic algorithms[J].European Journal of Operational Research,2001,(4):282-292.
  • 5[5]KIM K H,MOON K C.Berth scheduling by simulated annealing[J].Transportation Research,2003,Part B 37:541-560.
  • 6Imai A,Nishimura E,Papadimitriou S.The Dynamic Berth Allocation Problem for a Container Port[J].Transportation Research (Part B) (S0191-2615),2001,35(4):401-417.
  • 7Kim K H,Moon K C.Berth Scheduling by Simulated Annealing[J].Transportation Research (Part B) (S0191-2615),2003,37(6):541-560.
  • 8A Mathematical Model and a Heuristic Algorithm for Berth Planning[EB/OL].(2000-06)[2006-11].http://logistics.ie.pusan.ac.kr/bk21/pdf/kcMoon.pdf.

共引文献23

同被引文献20

  • 1蔡芸,张艳伟.集装箱码头泊位分配的仿真优化方法[J].中国工程机械学报,2006,4(2):228-232. 被引量：18
  • 2Bierwith B,Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminal[J].European Joumal ofOperationResearch,2010.615-627.
  • 3Andrew Lim. Theberth planning problem operation research[J].Letters,1998.105-110.
  • 4Bierwirth 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.
  • 5Lai K K,Shih K.A Study of container berth allocation.Journal of Advanced Transportation,1992,26(1):45-60.
  • 6Park YM,Kim KH.A scheduling method for berth and quay cranes.OR Spectrum,2003,25(1):1-23.
  • 7Borodin A,El-Yaniv R.Online computation and competitive analysis.Cambridge University Press,1998.
  • 8Shalom M,Voloshin A,Wong PWH,et al.Online optimization of busy time on parallel machines.Theory and Applications of Models of Computation.Springer Berlin Heidelberg,2012:448460.
  • 9Albers S.Better bounds for online scheduling.SIAM Journal on Computing,1999,29(2):459-473.
  • 10Pruhs K,Sgall J,Tomg E.Online scheduling.Handbook of Scheduling:Algorithms,Models,and Performance Analysis,2004:15-19.

引证文献2

二级引证文献3

北方交通
2011年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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