Model and Hybrid Algorithm for Swap-body Vehicle Routing Problem

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.