不同车型车辆路径问题模型及混合算法

Model and Hybrid Algorithm for Swap-body Vehicle Routing Problem

在传统车辆路径问题(VRP)的基础上,求解带有中转站的不同车型车辆路径优化问题(SB-VRP)。以行驶成本低为目标,在扫描法形成初始解的基础上,采用禁忌算法进行优化搜索,通过实证分析对算法进行验证。结果表明:本文算法可以得到成本比初始解更优的解;增加不同车型之后的SB-VRP模型比传统VRP模型效率更高。

Based on the traditional vehicle routing problem（VRP）, the swap-body vehicle routing problem（SB-VRP） which contains transfer stations and different vehicle types is solved. With the purpose of a lower cost,tabu search algorithm is employed to optimize the initial solution figured out by the sweep method. Results show that with the proposed method, a better solution with lower cost can be obtained; after adding different vehicle types,the model of SB-VRP is more efficient than traditional VRP.