期刊文献+

基于GASA的带时间窗航运空箱调运模型 被引量:2

Model of Empty Container Transportation with Time Window Based on GASA
下载PDF
导出
摘要 空箱调运是航运集装箱运输中不可缺少的环节,当集装箱过早到达港口时会产生港口储存费用,当集装箱过晚到达港口时会产生机会损失成本。基于此,通过考虑集装箱种类及运输方式的多样性,建立了以总成本最小为目标带时间窗约束的空箱调运模型;在遗传算法基础上引入模拟退火算法对该模型进行求解,以一定的退火概率来确定是否接受变异;通过适应度排序来采取精英保留政策防止最优个体被破坏,并构造了惩罚项处理约束条件。研究结果表明:遗传模拟退火算法(GASA)能够有效的解决空箱调运问题。 Empty container transportation is an indispensable link in shipping container transportation.When the container arrives at the port too early,the port storage cost will be incurred,and when the container arrives at the port too late,there will be opportunity loss cost.Based on this,considering the diversity of container types and transportation modes,an empty container transportation model with time window constraints was established with the goal of minimizing the total cost.On the basis of genetic algorithm,the simulated annealing algorithm was introduced to solve the proposed model,and a certain annealing probability was used to determine whether to accept the mutation.The elitist retention policy was adopted by fitness ranking to prevent the optimal individual from being destroyed,and the penalty term processing constraint conditions were constructed.The research results show that the genetic simulated annealing algorithm can effectively solve the problem of empty container transportation.
作者 闵德权 孙海萍 MIN Dequan;SUN Haiping(School of Traffic&Transportation Engineering,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处 《重庆交通大学学报(自然科学版)》 CAS CSCD 北大核心 2022年第6期8-13,共6页 Journal of Chongqing Jiaotong University(Natural Science)
关键词 交通运输工程 集装箱调运 改进遗传退火算法 时间窗 traffic and transportation engineering container transportation improved GASA time window
  • 相关文献

参考文献8

二级参考文献58

  • 1初良勇,田质广,谢新连.组合预测模型在物流需求预测中的应用[J].大连海事大学学报,2004,30(4):43-46. 被引量:59
  • 2汪传旭,刘大熔,贺斌.随机条件下空箱调配模型研究[J].交通运输工程学报,2001,1(3):119-122. 被引量:7
  • 3刘长俭,张庆年.基于时间序列BP神经网络的集装箱吞吐量动态预测[J].水运工程,2007(1):4-7. 被引量:27
  • 4H. FLOREZ, Empty-Container Repositioning and Leasing: An Optimization Model, PH. D dissertation [J]. Polytechnic Institute of New York, 1986,18-20.
  • 5Alfred V. Aho,John E. Hopcraft,Jeffrey D. Vllman.计算机算法的设计与分析[M].黄林鹏,王德俊,张仕,译.北京:机械工业出版社,2006.
  • 6Abrache, J. , Crainic, T. G. , Gendreau, M.. A new decomposition algorithm for the deterministic dynamic allocation of empty containers [J], Transportation Research, 1999,11(3): 49-99.
  • 7Sook Tying Choong, Michael H. Cole, Erhan Kutanoglu. Empty container management for intermodal transportation networks [ J ], Transportation Research Part E, 2002,38(2): 423-438.
  • 8Cheung R K, Chen C Y. A two-stage stochastic network model and solution methods for the dynamic empty container allocation Problem [ J ]. Transportation Science, 1998, 32 (2) : 142-162.
  • 9Choong S T, Cole M H. Kutanoglu E, Empty container management for intermodal transportation networks[ J]. Transportation Researeh Part E, 2002, 38: 423-438.
  • 10Li J A, Liu K, Leung S C H, Lai K K. Empty container management in a port with long-run average criterion[ J ]. Mathemati- cal & Computer Modelling, 2004, 40(1-2) : 85-100.

共引文献53

同被引文献18

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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