期刊文献+

考虑干涉和优先度的多目标岸桥调度策略 被引量:2

Multi-objective Quay Crane Scheduling with Interference and Priority in Consideration
下载PDF
导出
摘要 针对岸桥调度问题的特性,分析了岸桥支援对提高港口整体效率的影响,建立了包含任务之间优先关系和岸桥之间不可交叉性和安全等条件的多目标混合整数规划模型,提出了一种启发式求解算法,验证了在一定时间内,启发式算法可以得到较优的可行解。而QCSP单目标和多目标计算结果表明,减少岸桥等待和移动时间,有助于岸桥更好地支援邻近船舶,加快港口整体运作效率,提高港口竞争力。 The influence of quay crane support on the overall efficiency of the port was analyzed .A multi-objective quay crane scheduling problem with interference and priority was mainly researched .The completion time of tasks was minimized as well as the quay crane ’ s moving time and waiting time was reduced .According to characteristics of quay crane scheduling , a multi-objective mixed integer programming model was established .And a heuristic algorithm was proposed to solve quay crane scheduling problem .It was verified that within a certain time , heuristic algorithms can obtain a better feasible solution .The comparison of calculation results of QCSP single objective and multi-objective illustrates that reducing quay crane waiting time and travel time can help to support other ships and increase the whole efficiency of the port .The competitive strength of the port could therefore be increased .
作者 丁玲 梁承姬
出处 《武汉理工大学学报(信息与管理工程版)》 CAS 2014年第3期360-364,共5页 Journal of Wuhan University of Technology:Information & Management Engineering
基金 国家自然科学基金资助项目(71071093) 上海市自然科学基金资助项目(10ZR1413300) 上海市教委创新基金资助项目(11YZ136) 上海市科委创新基金资助项目(09DZ2250400 9530708200 10190502500) 上海市重点学科资助项目(J50604)
关键词 岸桥调度 等待时间 移动时间 混合整数规划 启发式算法 QCSP waiting time moving time mixed integer programming heuristic algorithm
  • 相关文献

参考文献10

  • 1范志强,乐美龙.最小化最大完工时间与等待时间的岸桥作业调度双目标优化及其遗传算法[J].系统管理学报,2013,22(1):120-127. 被引量:13
  • 2DAGANZO C F. The crane scheduling problem[ J ]. Trans- portation Research Part B, 1989,23(3):159-175.
  • 3DAGANZO C F, PETERKOFSKY R I. A branch and bound solution method for the crane scheduling prob- lem [ J ]. Transportation Research B, 1990,24 (3) : 159 - 172.
  • 4KIM K H, PARK Y M. A crane scheduling method for port container terminals [ J ]. European Journal of Op- erational Research, 2004,156( 1 ) :752 -768.
  • 5LEE D H. Quay crane scheduling with non- interfer- ence constraints in port container terminals [ J ]. Trans- portation Research Part E, 2008,44( 1 ) :124- 135.
  • 6MOCCIA L, CORDEAU J F, GAUDIOSO M. A branch -and -cut algorithm for the quay crane scheduling problem in a container terminal [ J ]. Naval Research Lo- gistics, 2006,53(1) :45 -59.
  • 7MARCELLO S, JEAN F C. A tabu search heuristic for the quay crane scheduling problem [ J ]. Journal of Scheduling,2007,10(4 - 5 ) :327 - 336.
  • 8NATHAN N. An efficient genetic algorithm for solving the quay erane scheduling problem [ J]. Expert Sys- tems with Applications,2012,39 ( 2 ) : 13108 - 13117.
  • 9CHUNG S H, CHOY K L. A modified genetic algo- rithm for quay crane scheduling operations [ J ]. Expert Systems with Applications, 2012,39( 1 ) :4213 -4221.
  • 10BIERWIRTH C, MEISEL F. A fast heuristic for quay crane scheduling with interference constraints [ J ]. Journal of Scheduling, 2009,12( ! ) :345 - 360.

二级参考文献12

  • 1曾庆成,高宇.集装箱码头装卸桥调度优化模型与算法[J].计算机工程与应用,2006,42(32):217-219. 被引量:16
  • 2Steenken D, VoB S, Stahlbock R. Container terminal operation and operations research-a classification and literature review[J]. OR Spectrum, 2004, 26: 3-49.
  • 3Lim A, Rodrigues B, Xiao F, et al. Crane scheduling with spatial constraints [J]. Naval Research Logistics, 2004, 51 (3): 386-406.
  • 4Kim K H, Park Y M. A crane scheduling method for port container terminals [J]. European Journal of Operational Research, 2004, 156 (3): 752-768.
  • 5Lim A R, Rodrigues B, Xu Z. A m-parallel crane scheduling problem with a non-crossing Constraint [J]. Naval Research Logistics 2007, 54 (2): 115- 127.
  • 6Lee D H, Wang H Q, Miao L X. Quay crane scheduling with non-interference in port container terminals[J]. Transportation Research Part E, 2008, 44 (1): 124-135.
  • 7Bierwirth C, Meisel F. A {ast heuristic for quay crane scheduling with interference constraints[J]. Journal of Scheduling, 2009(12): 345-360.
  • 8Whitley D. The GENITOR algorithm and selection pressure= why rank-based allocation of reroductive trials is best [A]. In= Proceedings o{ the Third International Conference on Genetic Algorithms[C]// San Mateo, California, USA: Morgam Kaufmann Publishers, 1989: 116-112.
  • 9Davis L. Applying adaptive algorithms to epistatic domains[C]//In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, California, USA: Morgan Kaufmann, 1985, 162-164.
  • 10Manderick B, De Weger M, Spiessens P. The genetic algorithm and the structure of the fitness landscape [C]//In: Belew, Booker Ed. Proceedings of the fourth International Conference on Genetic Algorithms, San Mateo: Morgan Kaufmann, 1991, 143-150.

共引文献12

同被引文献3

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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