摘要
在集装箱货物运输和调度管理过程中,针对需求随机产生、不确定情形下的干货槽与冷藏槽转换数量问题,通过蒙特卡罗仿真模拟方法计算获取船舶的最优化调度顺序,提出了4类动态联动的集装箱延迟或拒绝策略;依据此顺序对船上2类船槽的数量加以转化,并设计了一种启发式迭代算法、在最优调度顺序基础上确定了能够使得集装箱数量总延迟最小以及公司收益最大的船槽数量分布。以法国海运集团运营的1条航线为具体算例进行深入剖析和讨论,进一步实验结果表明,运用该算法优化后,公司的平均收益值总体能从初始的5 251 493.88美元提高至5 290 486.25美元,有效提升了7.43‰。
In transportation processes and dispatching management of container cargos,the optimal deployment sequence of ships is determined by a Monte Carlo simulation method in order to solve problems of conversion quantity of dry and reefer containers under uncertain and/or random demand situations.Four types of dynamically linked strategies are proposed for delay or rejection of containers.The number of two different kinds of ship slots is converted according to the optimal deployment sequence.Further,a heuristic iterative algorithm is developed to determine the number of conversion quantity,which can minimize the total delay of these two types of containers with maximum profit.Moreover,a shipping route operated by French Maritime Group is taken as a case study.The results show that the average profit of the company can be effectively improved by 7.43‰,from 5 251 493.88 USD to 5 290 486.25 USD after optimized by this algorithm.
作者
栾鑫
程琳
刘微微
LUAN Xin;CHENG Lin;LIU Weiwei(School of Transportation,Southeast University,Nanjing 211189,China;Department of City and Regional Planning,University of North Carolina at Chapel Hill,Chapel Hill NC 27599,America)
出处
《交通信息与安全》
CSCD
北大核心
2019年第3期137-142,共6页
Journal of Transport Information and Safety
基金
国家自然科学基金项目(51578150,51378119)
国家留学基金项目(201806090195)资助
关键词
交通运输经济
船舶调度问题
不定需求
船槽转换
动态联动
启发式算法
最优化理论
transportation economy
deployment problem of ships
uncertain demand
conversion of ship slot
dynamically linked strategy
heuristic algorithm
optimization theory
