Fleet Size and Mix Vehicle Routing Problem with Backhauls: A Set Partitioning based Heuristic

DOI: 10.5176/2251-1938_ORS55

Authors: Niaz Wassan, Said Salhi and Mutaz Hajarat

Abstract:

In this paper we introduce a new variant of the classical vehicle routing problem (VRP) called the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). In this paper we also propose an efficient implementation of Set Partitioning Problem (SPP) based heuristic methodology to solve this problem. The SPP method is tested on a set of FSMVRPB data instances which we generated for this more realistic problem. The results are found which can be used for future benchmarking.

Keywords: Mixed Fleet Backhauling, Set Partitioning Problem, heuristic.