An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Abstract

The Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the 2-opt procedure. The proposed algorithm uses a number of local search operators such as swap, 1-0 insertion, 2-opt, and Dijkstra's Algorithm. In addition, in order to improve the search process, a diversification procedure is applied. The proposed algorithm is thentested on the data sets from the literature