期刊文献+

基于桥吊迁移的集装箱码头连续泊位分配算法研究 被引量:1

Algorithm for continuous berth allocation based on QCs transfer
下载PDF
导出
摘要 集装箱码头资源(包括泊位、桥吊、堆场等)的高效利用已经被深入研究很多年了,然而对于泊位分配中桥吊分配的研究大多停留在静态分配最大数量桥吊上。为了弥补静态分配桥吊的不足,第一次研究了基于两船之间桥吊迁移的泊位分配问题,通过桥吊迁移的决策方法,最终设计出了一个新的泊位分配算法。实验证实设计的算法能更好地提高码头作业效率,表明了桥吊迁移在港口作业中的有效性。 The berth allocation problem has been studied extensively and much research progresses have been made. Howe- ver, the existing algorithms are mainly developed to figure out the vessel's best quay crane ( Qc ) allocation. To remedy the situation, this paper first studied quay cranes transfer between two vessels. Based on the strategy of deciding whether to trans- fer QCs or not in different conditions, it designed an algorithm for continuous berth allocation. The compare of the new algo- rithm and another existing algorithm shows that the new improves quay' s work efficiency.
出处 《计算机应用研究》 CSCD 北大核心 2013年第10期2972-2976,共5页 Application Research of Computers
基金 上海海事大学校基金资助项目(2009445654)
关键词 集装箱码头 桥吊迁移 连续泊位 不满意度 泊位分配算法 container terminal quay cranes transfer continuous berth dissatisfaction berth allocation algorithm
  • 相关文献

参考文献21

  • 1MEERSMANS P J M,DEKKER R. Operations research supportscontainer handling, No. El 2001-22 [ R]. [ S. 1.] : Rasmus School ofEconomics (ESE) ,2001.
  • 2VIS I F A, De KOSTER R. Transshipment of containers at a contai-ner terminal; an overview[J]. European Journal of OperationalResearch, 2003,147(1) :1-16.
  • 3STEENKEN D, VOB S, STAHLBOCK R. Container terminal opera-tion and operations research :a classification and literature review[ J].Or Spectrum, 2004,26(1) :3-49.
  • 4VACCA I, BIERLAIRE M, SALANI M. Optimization at containerterminals: status,trends and perspectives [ C]//Proc of the 7thSTRC. 2007 :1-12.
  • 5STAHLBOCK R, VOB S. Operations research at container terminals:a literature update[ J]. Or Spectrum ,2008,30( 1 ) :1*52.
  • 6LIM A. The berth planning problem [ J]. Operations ResearchLetters, 1998,22(2):105-110.
  • 7HANSEN P, OGUZ C. A note on formulations of the static and dy-namic berth allocation problems [ M]. [ S. 1.] : GERAD,它cole DesHautes fitudes Commerciales,2003 :34.
  • 8IMAI A, SUN X,NISHIMURA E, et al. Berth allocation in a con-tainer port : using a continuous location space approach [ J]. Trans-portation on Research Part B, 2005,39(3) : 199-221.
  • 9LEGATO P, MAZZA K M. Berth planning and resources optimizationat a container terminal via discrete event simulation[ J] . EuropeanJournal of Operational Research, 2001,133(3) :537-547.
  • 10IMAI A, NAGAIWA K( TAT C W. Efficient planning of berth allo-cation for container terminals in asia [ J]. Journal of AdvancedTransportation,1997,31 (1) :75-94.

二级参考文献25

  • 1韩晓龙,丁以中.集装箱港口泊位配置优化[J].系统工程理论方法应用,2006,15(3):275-278. 被引量:22
  • 2黄晓鸣,徐小义.排队论在港口规划设计中的应用[J].青岛大学学报(工程技术版),1996,11(3):59-62. 被引量:15
  • 3张煜,王少梅.基于遗传算法的泊位连续化动态调度研究[J].系统仿真学报,2007,19(10):2161-2164. 被引量:15
  • 4Steenken Dzrk, Vow3 Stefan and Stahlbock Robert.Container Terminal Operation and Operations Re- search-a Classification and Literature Review[J]. OR Spectrum, 2004(26): 3-49.
  • 5Imai Akio, Chen Hsieh Chia, Nishimura Etsuko and Papadimitriou Stratos. The Simultaneous Berth and Quay Crane Allocation Problem[J]. Transportation Research Part E, 2008, 44 : 900-920.
  • 6Park Young-Man and Kim Kap Hwan. A Scheduling Method for Berth and Quay Cranes[J]. OR Spec- trum, 2003(25): 1-23.
  • 7Meisel Frank and Bierwirth Christian. Heuristics for the Integration of Crane Productivity in the Berth Al- location Problem[J]. Transportation Research Part E, 2009(45): 196-209.
  • 8Li Na, Jin Zhihong. Optimization of continuous berth and quay crane allocation problem in seaport container terminal[C]. 2009 Second International Conference on Intelligent Computation Techno|ogy and Automa- tion, Changsha, 2009.
  • 9Imai A. , Nagaiwa K. , Chan, W.T. Efficient Plan- ning of Berth Allocation for Container Terminals in Asia[J]. Journal of Advanced Transportation, 1997 (31) : 75-94.
  • 10Imai 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.

共引文献29

同被引文献15

  • 1蔡芸,张艳伟.集装箱码头泊位分配的仿真优化方法[J].中国工程机械学报,2006,4(2):228-232. 被引量:18
  • 2Bierwirth 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.
  • 3Lai K K,Shih K.A Study of container berth allocation.Journal of Advanced Transportation,1992,26(1):45-60.
  • 4Park YM,Kim KH.A scheduling method for berth and quay cranes.OR Spectrum,2003,25(1):1-23.
  • 5Borodin A,El-Yaniv R.Online computation and competitive analysis.Cambridge University Press,1998.
  • 6Shalom 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.
  • 7Albers S.Better bounds for online scheduling.SIAM Journal on Computing,1999,29(2):459-473.
  • 8Pruhs K,Sgall J,Tomg E.Online scheduling.Handbook of Scheduling:Algorithms,Models,and Performance Analysis,2004:15-19.
  • 9Spielman D,Teng SH.Smoothed analysis of algorithms:Why the simplex algorithm usually takes polynomial time.Proc.of the Thirty-Third Annual ACM Symposium on Theory of Computing.2001.296-305.
  • 10Becchetti L,Leonardi S,Marchetti-Spaccamela A,et al.Average-case and smoothed competitive analysis of the multilevel feedback algorithm.Mathematics of Operations Research,2006,31(1):85-108.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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