Study on multi depot heterogeneous vehicle routing problem with an improved variable neighborhood search algorithm

Abstract

This study deals with the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW) which is complex and still not resolved well. The objective is to determine the best fleet composition as well as the set of routes that minimize the total cost with known demands. To solve the problem, mathematical model of the MDHVRPTW is constructed and an improved variable neighborhood search algorithm is proposed. In the algorithm, the hybrid operators of insert and exchange are used to achieve the shaking process and the later optimization process is presented to improve the solution space, the bestimprovement strategy is adopted which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions. The developed algorithm was tested in benchmark instances. The results obtained are quite competitive with those found in the literature and new improved solutions are reported. And finally the proposed model and algorithm is applied to the large water project in China to solve the allocation of vehicles and routes, it demonstrates that the systematic method is effective and feasible. © 2013 Asian Network for Scientific Information.