Resumen

DAZA, Julio Mario; MONTOYA, Jairo R  y  NARDUCCI, Francesco. SOLVING THE CAPACITATED VEHICLE ROUTING PROBLEM USING A TWOPHASE METAHEURISTIC PROCEDURE. Rev.EIA.Esc.Ing.Antioq [online]. 2009, n.12, pp.23-38. ISSN 1794-1237.

This paper presents an alternative procedure to solve the Capacitated Vehicle Routing Problem (CVRP) with homogeneous fleet. The paper proposes a two-phase metaheuristic algorithm: routes design and fleet scheduling. The first phase is based on heuristics and metaheuristics procedures in order to build an initial solution that is then improved using tabu search to obtain non-dominated solutions in polynomial computational time. For the second phase, corresponding to fleet scheduling, the problem is approached using an analogy with the identical parallel machine scheduling problem. This procedure looks for the minimization of the fixed cost of using installed capacity as the objective function. The proposed procedure was tested using both a random-generated instance and real data, giving competitive results in comparison with other heuristics tested.

Palabras clave : vehicle routing problem; traveling salesman problem; combinatorial optimization; heuristic.

        · resumen en Español | Portugués     · texto en Español     · Español ( pdf )