Title
A hybrid genetic algorithm for the multi-depot open vehicle routing problem
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.
Year
DOI
Venue
2014
10.1007/s00291-012-0289-0
OR Spectrum
Keywords
Field
DocType
computational result,cplex solver,exact method,paper study,existing approach,multi-depot open vehicle,new hybrid genetic algorithm,sophisticated tabu search approach,proposed algorithm,multi-depot vrp benchmarks
Economics,Mathematical optimization,Vehicle routing problem,Destination-Sequenced Distance Vector routing,Depot,Solver,Tabu search,Operations management,Genetic algorithm
Journal
Volume
Issue
ISSN
36
2
1436-6304
Citations 
PageRank 
References 
11
0.58
36
Authors
3
Name
Order
Citations
PageRank
Ran Liu1373.81
Z. B. Jiang224236.08
Na Geng37513.17