A Genetic Algorithm’s Approach to the Optimization of Capacitated Vehicle Routing Problems

This chapter addresses the family of problems known in the literature as Capacitated Vehicle Routing Problems (CVRP). A procedure is introduced for the optimization of a version of the generic CVRP. It generates feasible clusters and, in a first step, yields a coding of their ordering. The next stage provides this information to a genetic algorithm for its optimization. A selective pressure process is added in order to improve the selection and subsistence of the best candidates. This arrangement allows improving the performance of the algorithm. We test it using Van Breedam and Taillard’s problems, yielding similar results as other algorithms in the literature. Besides, we test the algorithm on real-world problems, corresponding to an Argentinean company distributing fresh fruit. Four instances, with 50, 100, 150 and 200 clients were examined, giving better results than the current plans of the company.Fil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; ArgentinaFil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; ArgentinaFil: Miguel, Fabio Maximiliano. Universidad Nacional de Río Negro; Argentin