An Evolutionary Algorithm Based on Repeated Mutations for Solving the Capacitated Vehicle Routing Problem

Krunoslav Puljić

Abstract


An evolutionary algorithm for solving the capacitated vehicle routing problem is described. The algorithm employs repeated mutations in a manner similar to local search. Experiments are presented, where the algorithm has been implemented and tested on some benchmark problem instances.

Keywords


capacitated vehicle routing problem, evolutionary algorithms, repeated mutations, local search, experiments

Full Text:

PDF


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

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

Crossref Similarity Check logo

Crossref logologo_doaj