Classical heuristics for the capacitated VRP
The vehicle routing problem
Metaheuristics for the capacitated VRP
The vehicle routing problem
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
A general heuristic for vehicle routing problems
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
Applying hybrid meta-heuristics for capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
Edge assembly crossover for the capacitated vehicle routing problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems
Computers and Industrial Engineering
The multi-depot capacitated location-routing problem with fuzzy travel times
Expert Systems with Applications: An International Journal
Genetic algorithm with iterated local search for solving a location-routing problem
Expert Systems with Applications: An International Journal
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem
Expert Systems with Applications: An International Journal
A variable neighborhood search for the multi-depot vehicle routing problem with loading cost
Expert Systems with Applications: An International Journal
Computers and Operations Research
An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem
Journal of Heuristics
Hi-index | 12.06 |
The capacitated vehicle routing problem (CVRP) aims to determine the minimum total cost routes for a fleet of homogeneous vehicles to serve a set of customers. A wide spectrum of applications outlines the relevance of this problem. In this paper, a hybrid heuristic method IVND with variable neighborhood descent based on multi-operator optimization is proposed for solving the CVRP. A perturbation strategy has been designed by cross-exchange operator to help optimization escape from local minima. The performance of our algorithm has been tested on 34 CVRP benchmark problems and it shows that the proposed IVND performs well and is quite competitive with other state-of-the-art heuristics. Additionally, the proposed IVND is flexible and problem dependent, as well as easy to implement.