Vehicle routing problem modelling to minimize a number of vehicle by considering heterogenous fleet vehicle

摘要

This paper presents the development of a model of Vehicle Routing Problem (VRP) with heterogenous vehicle fleet size and mix vehicle routing (HFSMVR). The solution is built using a heuristic approach, namely sequential insertion and 1-0 relocation improvement. The model considers aspects of multiple trips, multiple products and compartments, split delivery, and multiple time windows. The model is applied to solve the problem of fuel oil distribution in Nusa Tenggara Timur (NTT). Based on the model of VRP HFSMVR, tankers with capacity of 2.000 kilolitres and 4,700 kilolitres are the solution for the distribution problem that gives minimum of tour quantity, total time of completion, and range of completion time. The results of this study shows that in the case of heterogenous fleet size, selected tankers were varied and not necessarily the ones with largest capacity.