A Hybrid Algorithm to Solve Periodic Vehicle Dispatching Problem with Heterogeneous Vehicles in Logistics Transportation

Abstract

The vehicle dispatching problem (VDP) is researching how to arrange vehicles’ transportation, which has been addressed by many scholars. In the field of logistics transportation, the vehicle dispatching problem is presented in a special form, that is, the periodic vehicle dispatching problem (PVDP) with heterogeneous vehicles. In order to solve this problem and improve the efficiency of vehicles, a round recombination algorithm (RRA) with two operators are designed in this paper. And a hybrid algorithm consisting of RRA and simulated annealing algorithm is also proposed to improve RRA. Three groups of experiments are carried out to test the performance of designed algorithms in different scenarios. The results of these experiments prove the effectiveness of RRA. The results also show the superiority of hybrid algorithm to RRA.