viernes, 22 de junio de 2018

Ficha del recurso:


Vínculo original en EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 221 (2):285-295; 10.1016/j.ejor.2012.03.016 SEP 1 2012
Subramanian, A; Penna, PHV; Uchoa, E; Ochi, LS

Última actualización:

jueves, 28 de junio de 2012

Entrada en el observatorio:

jueves, 28 de junio de 2012



Archivado en:

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP generalizes the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types, with distinct capacities and costs. The objective is to determine the best fleet composition as well as the set of routes that minimize the total costs. The proposed hybrid algorithm is composed by an Iterated Local Search (ILS) based heuristic and a Set Partitioning (SP) formulation. The SP model is solved by means of a Mixed Integer Programming solver that interactively calls the ILS heuristic during its execution. The developed algorithm was tested in benchmark instances with up to 360 customers. The results obtained are quite competitive with those found in the literature and new improved solutions are reported. (C) 2012 Elsevier B.V. All rights reserved.