Journal of Heuristics

, Volume 19, Issue 2, pp 201–232

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem


    • Instituto do Noroeste Fluminense de Educação SuperiorUniversidade Federal Fluminense
    • Instituto de ComputaçãoUniversidade Federal Fluminense
  • Anand Subramanian
    • Departamento de Engenharia de Produção, Centro de TecnologiaUniversidade Federal da Paraíba
    • Instituto de ComputaçãoUniversidade Federal Fluminense
  • Luiz Satoru Ochi
    • Instituto de ComputaçãoUniversidade Federal Fluminense

DOI: 10.1007/s10732-011-9186-y

Cite this article as:
Penna, P.H.V., Subramanian, A. & Ochi, L.S. J Heuristics (2013) 19: 201. doi:10.1007/s10732-011-9186-y


This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP is \(\mathcal{NP}\)-hard since it is a generalization of the classical Vehicle Routing Problem (VRP), in which clients are served by a heterogeneous fleet of vehicles with distinct capacities and costs. The objective is to design a set of routes in such a way that the sum of the costs is minimized. The proposed algorithm is based on the Iterated Local Search (ILS) metaheuristic which uses a Variable Neighborhood Descent procedure, with a random neighborhood ordering (RVND), in the local search phase. To the best of our knowledge, this is the first ILS approach for the HFVRP. The developed heuristic was tested on well-known benchmark instances involving 20, 50, 75 and 100 customers. These test-problems also include dependent and/or fixed costs according to the vehicle type. The results obtained are quite competitive when compared to other algorithms found in the literature.


Heterogeneous Fleet Vehicle Routing ProblemFleet size and mixMetaheuristicIterated Local Search
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2011