A hybrid algorithm for the heterogeneous fleet vehicle routing problem.
No Thumbnail Available
Date
2012
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Routing, Heterogeneous fleet, Matheuristics, Iterated local search
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: <https://www.sciencedirect.com/science/article/pii/S0377221712002093>. Acesso em: 16 jan. 2018.