An iterated local search heuristic for the heterogeneous fleet vehicle routing problem.
No Thumbnail Available
Date
2013
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem
(HFVRP). The HFVRP is 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.
Description
Keywords
Heterogeneous fleet vehicle routing problem, Fleet size and mix, Iterated local search, Metaheuristic
Citation
PENNA, P. H. V,; SUBRAMANIAN, A.; OCHI, L. S. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, Dordrecht, v. 19,p. 201-232, 2013. Disponível em: <https://link.springer.com/article/10.1007/s10732-011-9186-y>. Acesso em: 16 jan. 2018.