用户名: 密码: 验证码:
基于模拟退火算法的甩挂运输路径规划
详细信息    查看官网全文
摘要
甩挂运输通过卡车与挂车之间的拖带和分离,实现了装卸过程和运输过程的并行化,其路径规划对于物流企业降低运输成本和提高运输效率有着重要意义。本文提出了甩挂运输路径规划问题的整数规划模型,并利用基于模拟退火算法的两阶段启发式算法进行了求解,最后通过对随机生成的问题算例进行仿真实验,说明此算法解决该甩挂运输路径规划问题的适用性。
Through the towing and separation between the truck and trailer,Swap Trailer implements the parallelization of the process of loading and unloading process and transportation process.For logistics enterprises,it has an important significance on reducing transport costs and improving the efficiency of transportation by planning the path.In this paper,the integer programming model of Swap Trailer Path Planning(STPP)is built,and then a two-phase heuristic algorithm based on simulated annealing algorithm is introduced to solve it.Finally,through the example simulation experiments on the issue of randomly generated,it illustrated practicality of the algorithm to solve the STPP.
引文
[1]Lin S W,Yu V F.Chou S Y.Solving the truck and trailr routing problem based on a simulated annealing heuristic[J].Commputers&Operations Research,2009,36(5):1683-1692.
    [2]Tan K CChew Y H.Lee L H.A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems[J].European Journal of Operational Research,2006,172(3):855-885.
    [3]Villegas J G.Prins C,Prodhon C.et al.A GRASP with evolutionary path relinking for the truck and trailer routing problem[J].Computers&Operations Research,2011,38(9):1319-1334.
    [4]Lin S W,Yu V F,Lu C C.A simulated annealing heuristic for the truck and trailer routing problem with time windows[J].Expert Systems with Applications,2011,38(12):15244-15252.
    [5]Derigs U.Pullmann M,Vogel U.Truck and trailer routing-Problems.heuristics and computational experience[J].Computers&Operations Research.2013,40(2):536-546.
    [6]Lin S W,Yu V F.Chou S Y.A note on the truck and trailer routing problem[J].Expert Systems with Applications,2010,37(1):899-903.
    [7]Villegas J G.Prins C,Prodhon C,et al.GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots[J].Engineering Applications of Artificial Intelligence,2010.23(5):780-794.
    [8]Li Hongqi.Li Yanran.Zhao Qiuhong.et al.The tractor and semitrailer routing considering carbon dioxide emissions[J].Mathematical Problems in Engineering,2013,2013:1-12.
    [9]Li Hongqi.Lu Yanran.,Zhang Jun,et al.Solving the tractor and semi-trailer routing problem based on a heuristic approach[J].Mathematical Problems in Engineering,2012,2012:1-12.
    [10]Imai A,Nishimura E,Current J.A Lagrangian relaxation-based heuristic for the vehicle routing with full container load[J].European Journal of Operational Research,2007,176(1):87-105.
    [11]Gendreau M.,Iori M.,Laporte G.A tabu search algorithm for a routing and container loading problem[J].Transportation Science,2006,40(3):342-350.
    [12]Xue Zhaojie,Zhang Canrong.Lin Weihua.et al.A tabu search heuristic for the local container drayage problem under a new operation mode[J].Transportation Research Part E Logistics&Transportation Review,2014,62(1):136-150.
    [13]Batsyn M,Ponomarenko A.Heuristic for a real-life truck and trailer routing problem☆[J].Procedia Computer Science,2014,31:778-792.
    [14]Drexl M.On some generalized routing problems[D].Aachem,NKW,Germany:RWTH Aachen University,2007.
    [15]Drexl M.Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments[J].Networks,2014,63(1):119-133.
    [16]Drexl M.Synchronization in vehicle routing—A survey of VRPs with multiple synchronization constraints[J].Transportation Science,2012,46(3):297-316.
    [17]Drexl M.Applications of the vehicle routing problem with trailers and transshipments[J].European Journal of Operational Research,2013,227(2):275-283.
    [18]胡志华,曹杨,王云霞.集装箱集散的空重箱循环甩挂调度方法[J].武汉理工大学学报,2012,34(10):68-73.
    [19]邢曦文,毛钧,张睿,等.基于混合流水作业组织的集装箱码头装卸作业集成调度优化[J].中国管理科学,2014,22(10):97-105.
    [20]胡志华.集装箱码头间互拖的集卡甩挂运输调度问题[J].重庆交通大学学报:自然科学版,2013,32(2):313-317.
    [21]张江华,李进,高敏刚.同时集散货物的开放式车辆路径问题研究[J].中国管理科学,2013,21(4):187-192.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700