engleski

An evolutionary algorithm based on repeated mutations for solving the capacitated vehicle routing problem

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.

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

nije evidentirano