期刊文献+

基于动态学习的泊位调度方案优化 被引量:8

Berth Scheduling Scheme Optimization Based on Dynamic Learning
下载PDF
导出
摘要 泊位调度方案的制定要依据在泊船舶的占用泊位情况及预计在泊时间,确定其他待泊船舶的靠泊位置与靠泊时间.然而,预计在泊时间受水文气象等多种复杂因素的影响,且影响程度是随时间动态变化的,给泊位调度方案的制定增加了难度.对此,本文采用动态学习方法对在泊时间计算函数进行更新,再基于所得函数对泊位调度方案进行优化.并设计了包含船舶在泊时间动态学习及泊位调度方案优化的并行算法,前者为后者提供更新的在泊时间计算函数,后者的实际执行结果为前者提供学习样本.通过算例对模型有效性进行了验证,结果表明:加入动态学习过程,船舶在泊时间的计算偏差得以降低;优化方案的平均在泊时间缩短2.4 h,总成本降低11.1%. Berth scheduling scheme for the dwelling vessels in the port is thoroughly determined by the present berths occupied and the estimated handling time of those mooring vessels.However,as the estimation on berth handling time for each vessel is heavily affected by weather and tide etc.and all the influences are fluctuated dynamically by time.Thus the berth scheduling scheme seldom meets the requirements in practice.In this paper,the dynamic learning method is proposed to update the calculation function of handing time,and then the berth scheduling scheme is optimized based on the updated function.A parallel algorithm is designed where the dynamic learning for handling time and optimization for berth scheduling scheme are included.The former provides the updated calculation function for the latter,and the actual execution results of the latter provide learning samples for the former.The effectiveness of the model is verified by examples.The results represent that the calculation deviation of handling time can be reduced by adding the dynamic learning process;and in the optimization scheme,the mean value of handling time is reduced by 2.4 hours and the total cost is reduced by 11.1%.
作者 王军 郭力铭 杜剑 王美蓉 WANG Jun;GUO Li-ming;DU Jian;WANG Mei-rong(School of Transportation Engineering,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2018年第5期197-203,共7页 Journal of Transportation Systems Engineering and Information Technology
基金 国家社会科学基金(13BGJ045)~~
关键词 水路运输 泊位调度方案优化 动态学习 船舶在泊时间 并行算法 water transportation berth scheduling scheme optimization dynamic learning vessel handling time parallel algorithm
  • 相关文献

参考文献2

二级参考文献18

  • 1Nishimura E, Imai A, Stratos P. Berth allocation planning in the public berth system by genetic algorithms [ J ]. EuropeanJournal of Operational Research, 2001, 131(2) ; 282-292.
  • 2Imai A, Nishimura E, Stratos P. Berth allocation with service priority[ J]. Transportation Research Part B, 2003,37(5):437-457.
  • 3Kim K H , Moon K C, Berth scheduling by simulated annealing[ J]. Transportation Research Part B,2003,37(6) : 541-560.
  • 4Imai A, Sun X,Nishimura E et al. Berth allocation in a container port: using a continuous location space approach [ J].Transportation Research Part B, 2005 , 39(3) : 179-221.
  • 5Imai A, Nishimura E, Hattori M, et al. Berth allocation at indented berths for mega-containervessels[ J]. European Journal ofOperational Research, 2007,179(2) : 579-593.
  • 6Wang F, Lim A. A stochastic beam search for the berth allocation problem[ J]. Decision Support Systems, 2007 , 42(4):2186-2196.
  • 7Park Y M , Kim K H. A scheduling method for berth and quay cranes[ J]. OR Spectrum, 2003 , 25(1) : 1-23.
  • 8Imai A, Chen H C, Nishimura E, et al. The simultaneous berth and quay crane allocation problem [ J ]. TransportationResearch Part E,2008,44(5) ; 900-920. '.
  • 9Liang C, Huang Y,Yang Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocationplanning[ J]. Computers & Industrial Engineering, 2009,56(3) : 1021-1028.
  • 10Han XL,Lu Z Q, Xi L F. A proactive approach for simultaneous berth and quay crane scheduling problem with stochasticarrival and handling time[ J ]. European Journal of Operational Research, 2010,207 ( 3 ) : 1327-1340.

共引文献19

同被引文献45

引证文献8

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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