Journal of Heuristics

, Volume 19, Issue 2, pp 201-232

First online:

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

  • Puca Huachi Vaz PennaAffiliated withInstituto do Noroeste Fluminense de Educação Superior, Universidade Federal FluminenseInstituto de Computação, Universidade Federal Fluminense Email author 
  • , Anand SubramanianAffiliated withDepartamento de Engenharia de Produção, Centro de Tecnologia, Universidade Federal da ParaíbaInstituto de Computação, Universidade Federal Fluminense
  • , Luiz Satoru OchiAffiliated withInstituto de Computação, Universidade Federal Fluminense

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 Problem Fleet size and mix Metaheuristic Iterated Local Search