A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem

The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is a variant of the standard vehicle routing problem (VRP), in which the vertices have to be served using a fixed number of vehicles that could be different in size and fixed or variable costs. In this article, we propose an integer linear programming-based heuristic approach in order to solve the HFFVRP that could be used as a complementary tool to improve the performance of the existing methods of solving this problem. Computational results show the effectiveness of the proposed method.