Please use this identifier to cite or link to this item:
Title: A hybrid algorithm for the heterogeneous fleet vehicle routing problem.
Authors: Subramanian, Anand
Penna, Puca Huachi Vaz
Barboza, Eduardo Uchoa
Ochi, Luiz Satoru
Keywords: Routing
Heterogeneous fleet
Iterated local search
Issue Date: 2012
Citation: SUBRAMANIAN, A. et al. A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, v. 221, p. 285-295, 2012. Disponível em: <>. Acesso em: 16 jan. 2018.
Abstract: 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.
ISSN: 0377-2217
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_HybridAlgorithmHeterogeneous.pdf284,72 kBAdobe PDFView/Open    Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.