Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem
Management Science
Classical heuristics for the capacitated VRP
The vehicle routing problem
A genetic algorithm for the vehicle routing problem
Computers and Operations Research
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
A hybrid search algorithm with heuristics for resource allocation problem
Information Sciences—Informatics and Computer Science: An International Journal
Path relinking for the vehicle routing problem
Journal of Heuristics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
Computers and Operations Research
Genetic algorithm with iterated local search for solving a location-routing problem
Expert Systems with Applications: An International Journal
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Computers and Operations Research
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
Annals of Mathematics and Artificial Intelligence
Hi-index | 12.06 |
The capacitated vehicle routing problem (CVRP) is one of the most important problems in the optimization of distribution networks. The objective of CVRP, known demands on the cost of originating and terminating at a delivery depot, is to determine the optimal set of routes for a set of vehicles to deliver customers. CVRP is known to be NP-hard problem, and then it is difficult to solve this problem directly when the problem size is large. In this paper, a hybrid algorithm of simulated annealing and tabu search is applied to solve CVRP. It takes the advantages of simulated annealing and tabu search for solving CVRP. Simulation results are reported on classical fourteen instances and twenty large-scale benchmark instances. From simulation results, the proposed algorithm finds eight best solutions of classical fourteen instances. Additionally, the solutions of the proposed algorithm have also admirable performance for twenty large-scale benchmark instances. It shows that the proposed algorithm is competitive with other existing algorithms for solving CVRP.