MODEL OF VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERY, MULTI TRIPS, MULTI PRODUCTS AND COMPARTMENTS FOR DETERMINING FUEL DISTRIBUTION ROUTES

The industrial development in Indonesia encourages companies to have high sensitivity in competing to meet consumer demands promptly by considering minimum distribution costs. One of the factors that can affect distribution costs is route determination. Determining the distribution route is the Vehicle Routing Problem (VRP). The purpose of VRP is to arrange the order of distribution routes to produce a minimum total distance. This study aims to determine the fuel distribution route at TBBM Rewulu in one delivery period to obtain the optimal distribution route and minimize the vehicle mileage. Delivery is carried out using three types of tanker trucks with heterogeneous capacities. This study uses a mathematical model of Mixed Integer Linear Programming (MILP) by considering split delivery, multi trips, multi-products, and compartments.The branch and bound method in the LINGO solver has been used to solve this problem. This model was tested on a simple case using data of 8 customers with different distances and demand shipped by truck. The results obtained indicate that no boundaries are violated, and all consumers are served. The mathematical model built is still general, so it can solve similar cases. A model can be developed for further research by adding VRP variants such as time windows and adding the product types to represent the entire existing system.