期刊文献+

离散泊位布局下的泊位岸桥动态协调调度 被引量:8

Integrated dynamic berth and quay-crane scheduling based on discrete berth layout
下载PDF
导出
摘要 为了制定合理的集装箱码头泊位岸桥资源调度计划,提高码头作业效率和客户满意度,基于离散泊位布局,建立了以在港集装箱船总的服务成本最小为优化目标的动态泊位岸桥协调调度模型。设计了遗传算法对模型求解,通过将部分约束条件嵌入算法结构简化了模型求解难度,并对算法迭代过程中的不可行解采用逐时刻基因调整策略进行修复。经过若干算例的数值实验,验证了模型和算法的可行性和有效性。 A reasonable allocation of port resources in container terminals can improve the efficiency of terminal operation and customer satisfaction. To achieve this goal, an integrated dynamic berth and quay-crane scheduling model which aims at minimizing the total service cost of vessels is proposed based on discrete berth layout. Then an improved genetic algorithm is presented to solve this model. Some constraint conditions of the model are embedded in the structure of this algorithm to reduce the model-solving difficulty. And infeasible solutions generated in the iterative process are repaired by using moment-to-moment gene-adjustment strategy. At last, the effectiveness and efficiency of the proposed model and algorithm are testified by several test instances.
出处 《计算机工程与应用》 CSCD 北大核心 2018年第3期265-270,共6页 Computer Engineering and Applications
基金 辽宁省自然科学基金(No.2015020033)
关键词 离散泊位 动态协调调度 遗传算法 集装箱码头 discrete berth layout integrated dynamic scheduling genetic algorithm container terminal
  • 相关文献

参考文献4

二级参考文献41

  • 1张煜,王少梅.基于遗传算法的泊位连续化动态调度研究[J].系统仿真学报,2007,19(10):2161-2164. 被引量:15
  • 2LAI K K,SHIH K.A study of container berth allocation[J].Journal of Advanced Transportation,1992,26(1):45-60.
  • 3IMAI 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.
  • 4KIM K H,MOON K C.Berth scheduling by simulated annealing[J].Transportation Research Part B:Methodological,2003,37(6):541-560.
  • 5DAGANZO C F.The crane scheduling problem[J].Transportation Research Part B:Methodological,1989,23(3):159-175.
  • 6GUAN 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.
  • 7KIM K H,PARK Y M.A crane scheduling method for port container terminals[J].European Journal of Operational Research,2004,156(3):752-768.
  • 8IMAI 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.
  • 9LIANG C,HUANG Y,YANG Y.A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning[J].Computers & Industrial Engineering,2009,56(3):1021-1028.
  • 10LEE Y,CHEN C Y.An optimization heuristic for the berth scheduling problem[J].European Journal of Operation Research,2009,196(2):500-508.

共引文献39

同被引文献49

引证文献8

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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