A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem

Abdesslem Layeb, Meryem Ammi, Salim Chikhi


This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem, which characterized by using a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic and a simulated annealing procedure as an improvement phase. The new constructive heuristic uses four steps to generate feasible initial solutions, and the simulated annealing enhances these solutions found to reach the optimal one. We tested our algorithm on two sets of benchmark instances and the obtained results are very encouraging.


optimization problems, VRP, constructive heuristics, nearest neighbor heuristic

Full Text:


DOI: https://doi.org/10.2498/cit.1002085

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo