Paper Info
Title
A New Hybridization of Evolutionary Algorithms, GRASP and Set-Partitioning Formulation for the Capacitated Vehicle Routing Problem.
Abstract
This work presents a new hybrid method based on the route-first-cluster-second approach using Greedy Randomized Adaptive Search Procedure (GRASP), Differential Evolution (DE), Evolutionary Local Search (ELS) and set-partitioning problem (SPP) to solve well-known instances of Capacitated Vehicle Routing Problem (CVRP). The CVRP consists of minimizing the cost of a fleet of vehicles serving a set of customers from a single depot, in which every vehicle has the same capacity. The DE heuristic is used to build an initial feasible solution and ELS is applied until a local minimum is found during the local search phase of the GRASP. Finally, the SPP model provides a new optimal solution with regard to the built solutions in the GRASP. We perform computational experiments for benchmarks available in the literature and the results show that our method was effective to solve CVRP instances with a satisfactory performance. Moreover, a statistical test shows that there is not significant difference between the best known solutions of benchmark instances and the solutions of the proposed method.
Year
DOI
Venue
2020
10.1007/978-3-030-61377-8_1
BRACIS
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
André Manhães Machado100.34
Maria C. Boeres2233.67
Rodrigo de Alvarenga Rosa300.68
Geraldo Regis Mauri4888.79