期刊文献+

基于鲁棒反应式策略的泊位和岸桥联合调度 被引量:20

Integrated scheduling for berth and quay cranes based on robust and reactive policy
原文传递
导出
摘要 集装箱码头作为一个复杂的物流节点,会受到多种不确定性因素的影响.针对这种情况,为保证码头作业计划能够平滑执行、提高系统的鲁棒性,提出了一种基于鲁棒反应式策略的泊位和岸桥联合调度方法,重点研究当不确定性因素发生时,如何通过泊位和岸桥联合实时调度提高系统的鲁棒性.泊位和岸桥联合实时调度策略分成两部分考虑:即泊位实时调度和岸桥实时调度;前者采用了ASAP(as soon as possible)的调整策略;后者采用MAS(multi-agent system)技术,充分利用码头的岸桥资源,设计出了一种基于CNP(contract-network-protocol)协商机制的岸桥实时调度模型.仿真实验表明在执行阶段采用这种泊位和岸桥联合实时调度策略相比仅采用泊位实时调度策略,可以更有效地降低不确定因素所带来的影响,进一步提高系统的鲁棒性. As a complex logistics node, the container terminal is affected by many uncertainties. In order to make terminal operating plan implemented smoothly and improve its robustness, a scheduling strategy for berth and quay cranes based on robust and reactive policy is proposed, focusing on how to increase the plan robustness through the real-time scheduling of berth and quay cranes when the uncertainties occurs. The real-time scheduling strategy includes the berth real-time scheduling and the quay cranes real-time scheduling. The former adopts the ASAP strategy. The latter adopts MAS technology, makes full use of quay cranes, and designs a real-time scheduling model for quay cranes based on CNP. The simulation tests show that this real-time scheduling strategy can achieve more stable plan than that just considering the berth real-time scheduling.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2013年第4期1076-1083,共8页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(70871090 71172071 70772052) 天津市自然科学基金(07JCYBJC05700)
关键词 集装箱码头 鲁棒调度 泊位 岸桥 CNP container terminal robust scheduling berth quay cranes CNP
  • 相关文献

参考文献14

  • 1Sun B, Sun J Q, Yang P. The design and implementation of berth allocation management system based on MAS[C]// 5th International Conference on Natural Computation, Tianjin, 2009: 593-597.
  • 2Lai K K, Shih K. A study of container berth allocation[J]. Journal of Advanced Transportation, 1992, 26:45 60.
  • 3Lim A. The berth planning problem[J]. Operations Research Letters, 1998, 22: 105-110.
  • 4Li C L, Cai X, Lee C Y. Scheduling with multiple-job-on-one-processor pattern[J]. IIE Transactions, 1998, 30(5): 433-445.
  • 5Haghani A, Kaisar E I. A model for designing container loading plans for container ships[C]//Annual Conference for Transportation Research Board, 2001: 55-62.
  • 6Peterkofsky R I, Daganzo C F. A branch and bound solution method for the crane scheduling problem[J]. Transportation Research Part B, 1990, 24(3): 159-172.
  • 7韩骏,孙晓娜,靳志宏.集装箱码头泊位与岸桥协调调度优化[J].大连海事大学学报,2008,34(2):117-121. 被引量:42
  • 8Park Y M, Kim K H. A scheduling method for berth and quay cranes[J]. OR Spectrum, 2003, 25: 1-23.
  • 9Imai A, Chen H C, Nishimura E, et al. The simultaneous berth and quay crane allocation problem[J]. Trans- portation Research Part E, 2008, 44(5): 900-920.
  • 10Liang C J, Huang Y F, 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.

二级参考文献91

共引文献102

同被引文献186

引证文献20

二级引证文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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