A hybrid genetic algorithm for the multi-depot open vehicle routing problem

  • Authors:

  • Ran Liu;Zhibin Jiang;Na Geng

  • Affiliations:

  • Department of Industrial Engineering and Logistics Management, School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China 200240;Department of Industrial Engineering and Logistics Management, School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China 200240;Department of Industrial Engineering and Logistics Management, School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China 200240

  • Venue:
  • OR Spectrum
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the multi-depot open vehicle routing problem (MDOVRP), a variant of the vehicle routing problem (VRP), in which vehicles start from several depots and are not required to return to the depot. Despite the vast amount of literature about VRPs, the MDOVRP has received very little attention from researchers. In this paper, a new hybrid genetic algorithm is presented for finding the routes that minimize the traveling cost of the vehicles. Computational results on a number of test instances indicate the proposed algorithm dominates the CPLEX solver and the existing approach in the literature. Meanwhile, experiments are conducted on multi-depot VRP benchmarks, and the results are compared with a sophisticated tabu search approach and an exact method.