Skip to Main content Skip to Navigation
Conference papers

Combining Genetic Algorithm with Constructive and Refinement Heuristics for Solving the Capacitated Vehicle Routing Problem

Abstract : This work presents a hybrid strategy for optimization of Capacitated Vehicle Routing Problem (CVRP) that employs Genetic Algorithms (GA) combined with the heuristics of Gillett & Miller (GM) and Hill Climbing (HC). The first heuristic is used to incorporate feasible solutions in the initial population of the GA while the second is responsible for the refinement of solutions after a certain number of generations without improvements. The computational experiments showed that the proposed strategy presented good results for the optimization of CVRP with respect to the quality of solutions well as the computational cost.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01615793
Contributor : Hal Ifip <>
Submitted on : Thursday, October 12, 2017 - 4:43:48 PM
Last modification on : Thursday, March 5, 2020 - 4:46:24 PM

File

434863_1_En_14_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Stanley Lima, Renato Santos, Sidnei Araujo, Pedro Schimit. Combining Genetic Algorithm with Constructive and Refinement Heuristics for Solving the Capacitated Vehicle Routing Problem. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2016, Iguassu Falls, Brazil. pp.113-121, ⟨10.1007/978-3-319-51133-7_14⟩. ⟨hal-01615793⟩

Share

Metrics

Record views

227

Files downloads

149