Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.