Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea

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 compu­ting times, better solutions for those obtained by the current traditional method for planning the routes.

• Autores: Puenayán, Duván Eduardo; Universidad del Valle; Londoño, Julio César; Universidad del Valle; Escobar, John Willmer; Pontificia Universidad Javeriana, Sede Cali; Linfati, Rodrigo; Universidad del Bío-Bío
• Tipo de recurso: Article of journal
• Fecha de publicación: 2014
• Institución: Universidad de Medellín
• Repositorio: Repositorio UDEM
• Idioma: spa
• OAI Identifier: oai:repository.udem.edu.co:11407/1836
• Acceso en línea: http://hdl.handle.net/11407/1836
• Palabra clave: vehicle routing problem; heterogeneous fleet; granular tabu search; problema de ruteo de vehículos; flota heterogénea; búsqueda tabú granular
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/