Enhancements to the localized genetic algorithm for large scale capacitated vehicle routing problems

This paper is a continuation of two previous papers where the authors used Genetic Algorithm with automated problem decomposition strategy for small scale capacitated vehicle routing problems (CVRP) and vehicle routing problem with time windows (VRPTW). In this paper they have extended their scheme to large scale capacitated vehicle routing problems by introducing selective search version of the automated problem decomposition strategy, a faster genotype to phenotype translation scheme, and various search reduction techniques. The authors have shown that genetic algorithm used with automated problem decomposition strategy outperforms the GAs applied on the problem as a whole not only in terms of solution quality but also in terms of computational time on the large scale problems