Resumen

PUENAYAN, Duván Eduardo; LONDONO, Julio César; ESCOBAR, John Willmer  y  LINFATI, Rodrigo. An algorithm based on a granular tabu search for the solution of a vehicle routing problem by considering heterogeneous fleet. Rev. ing. univ. Medellín [online]. 2014, vol.13, n.25, pp.81-98. ISSN 1692-3324.

This paper considers the vehicle routing problem with heterogeneous fleet (VRPH), which tries to determine the routes to be constructed for satisfying the demand of the customers by considering a fleet of vehicles with different capacities and costs not homogeneous. The main objective is to minimize the distance traversed by the different vehicles. This paper proposes a metaheuristic algorithm based on a granular tabu search for the solution of the problem. The algorithm allows infeasible solutions by penalizing them by a dynamic factor which is adjusted during the search. Computational experiments on real instances for a Colombian company show that the proposed algorithm is able to obtain, within short computing times, better solutions for those obtained by the current traditional method for planning the routes.

Palabras clave : vehicle routing problem; heterogeneous fleet; granular tabu search.

        · resumen en Español     · texto en Español     · Español ( pdf )