An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) is an important variant of the classical Capacitated (CVRP) that aims to find routes minimize total traveling cost a heterogeneous fleet vehicles. This problem great interest given its importance in many industrial and commercial applications. In this paper, we present Adaptive Iterated Local Search (AILS) heuristic for HFVRP. AILS local search-based meta-heuristic achieved good results CVRP. main characteristic adaptive behavior allows adjustment diversity control solutions explored during search process. proposed HFVRP was tested on benchmark instances containing up 360 customers. computational experiments indicate outperformed state-of-the-art metaheuristics 87% instances.