A NEW APPROACH TO THE OPTIMIZATION OF THE CVRP THROUGH GENETIC ALGORITHMS

MARIANO FRUTOS; FERNANDO TOHMÉ

AMERICAN JOURNAL OF OPERATIONS RESEARCH

SCIENTIFIC RESEARCH PUBLISHING

Lugar: Irvine; Año: 2012 vol. 2 p. 495 - 501

2160-8849

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 algo-rithm 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.