期刊文献+

集装箱码头泊位与装卸桥在应急情况下的联合调度研究

United Schedule Research of Berth and Quay Crane at Emergent State in Container Terminal
下载PDF
导出
摘要 船舶在集装箱码头的装卸作业时间是影响港口竞争力的重要因素,为缩短计划期内集装箱船舶在港口停留时间,以船舶在港时间和泊位空闲时间最小为目标,建立了泊位与装卸桥联合调度优化模型。通过对泊位调度与装卸桥分配相关联的问题进行系统分析,提出相邻的泊位之间共享装卸桥,将有限的装卸桥资源在船舶装卸任务间进行动态分配和排序,构建了整数规划模型,以提高泊位资源和装卸桥资源的利用率,从而最大限度地减少船舶的在港时间,并对所建模型设计了基于任务排序的染色体结构,考虑应急物资优先装卸规则,用遗传算法进行相应的求解。数值实验结果表明,泊位与装卸桥的联合调度比泊位与装卸桥的独立调度可有效提高集装箱码头的装卸效率,在满足应急船舶优先装卸的前提下,最小化船舶在港时间。 The time of ship loading and unloading operations in container terminal is an important factor affecting the com- petitiveness of container port, in order to shorten total time of the vessels in port at a planning horizon, an allied optimization method for berth and quay crane allocation was developed to minimize total turnaround time of all the berthing vessels and the idle time of berths. Interrelation between berth and quay crane allocation was analyzed, sharing quay cranes with the adjacent berths was put forward, dynamically allocating the limited quay cranes in the scheduling of loading and unloading tasks on each ship, an integer mathematical planning model was set up, so as to improve the utilization of berths and quay cranes, reduce the total turnaround time of vessels as far as possible, chromosome structure was designed based the se- quence of tasks, considering the rule of emergent supply load and unload first, and a corresponding genetic algorithm was designed to solve the problem. The resuh suggests that the method can improve container handling efficiency effectively compared with that of separate allocation, minimum the total turnaround time of vessels under the assumption of emergent vessels handling firstly.
出处 《军事交通学院学报》 2013年第3期62-67,共6页 Journal of Military Transportation University
关键词 集装箱运输 联合调度 集装箱码头 泊位分配 装卸桥调度 container transportation united scheduling container terminal berth allocation quay crane allocation
  • 相关文献

参考文献6

二级参考文献29

  • 1计明军,靳志宏.集装箱码头集卡与岸桥协调调度优化[J].复旦学报(自然科学版),2007,46(4):476-480. 被引量:47
  • 2韩晓龙,丁以中.集装箱港口泊位配置优化[J].系统工程理论方法应用,2006,15(3):275-278. 被引量:22
  • 3张煜,王少梅.基于遗传算法的泊位连续化动态调度研究[J].系统仿真学报,2007,19(10):2161-2164. 被引量:15
  • 4LAI K K,SHIH K.A study of container berth allocation[J].Journal of Advanced Transportation,1992,26(1):45-60.
  • 5IMAI A,NISHIMURA E,PAPADIMITRIOU S.The dynamic berth allocation problem for a container port[J].Transportation Research Part B:Methodological,2001,35(4):401-417.
  • 6KIM K H,MOON K C.Berth scheduling by simulated annealing[J].Transportation Research Part B:Methodological,2003,37(6):541-560.
  • 7DAGANZO C F.The crane scheduling problem[J].Transportation Research Part B:Methodological,1989,23(3):159-175.
  • 8GUAN Yong-pei,XIAO Wen-qiang,CHEUNG R K,et al.multi-processor task scheduling model for berth allocation:heuristic and worst-case analysis[J].Operations Research Letters,2002,30(5):343-350.
  • 9KIM K H,PARK Y M.A crane scheduling method for port container terminals[J].European Journal of Operational Research,2004,156(3):752-768.
  • 10IMAI A,CHEN H C,NISHIMURA E,et al.The simultaneous berth and quay crane allocationproblem[J].Transportation Research Part E:Logistics and Transportation Review,2008,44(5):900-920.

共引文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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