A New Approach to the Optimization of the CVRP through Genetic Algorithms

HTML  Download Download as PDF (Size: 148KB)  PP. 495-501  
DOI: 10.4236/ajor.2012.24058    6,317 Downloads   10,247 Views  Citations

ABSTRACT

This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.

Share and Cite:

M. Frutos and F. Tohmé, "A New Approach to the Optimization of the CVRP through Genetic Algorithms," American Journal of Operations Research, Vol. 2 No. 4, 2012, pp. 495-501. doi: 10.4236/ajor.2012.24058.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.