MULTIOBJECTIVE MATHEMATICAL MODELS AND SOLUTION APPROACHES FOR HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEMS

In this paper, we study three types of heterogeneous fixed fleet vehicle routing problems, which are capacitated vehicle routing problem, open vehicle routing problem and split delivery vehicle routing problem. We propose new multiobjective linear binary and mixed integer programming models for these problems, where the first objective is the minimization of a total routing and usage costs for vehicles, and the second one is the vehicle type minimization, respectively. The proposed mathematical models are all illustrated on test problems, which are investigated in two groups: small-sized problems and the large-sized ones. The small-sized test problems are first scalarized by using the weighted sum scalarization method, and then GAMS software is used to compute efficient solutions. The large-sized test problems are solved by utilizing the tabu search algorithm.

Automated summary

This paper investigates three types of heterogeneous fixed fleet vehicle routing problems and proposes new multiobjective programming models for each type. Experimental results show that small-sized test problems can be solved using weighted sum scalarization method and GAMS software, while large-sized test problems are efficiently solved by utilizing the tabu search algorithm.