Fleet Size from Split Delivery in Vehicle Routing Problems

Abstract

Vehicle Routing Problem (VRP) is a problem of determining the route by minimizing the number of vehicles used to minimize the total mileage of a vehicle to deliver an item to a customer that starts from a depot and ends at the depot. VRP relates to the distribution of goods, people, information, vehicles and roads. All customers must be visited only once and by one vehicle must not exceed the capacity of the vehicle. VRP varies due to real life constraints related to the type of vehicle, number of depots, conditions, transportation, and time period. Among them the problem of a heterogeneous vehicle fleet is a type of VRP whose vehicles have different capacities and costs, besides different vehicles also have a Split Delivery variation where customers can be visited by one, two, three or even four vehicles. This is due to the capacity constraints possessed by each courier, as a result if the first courier is unable to complete all orders from the customer then the order delivery can be continued by a second courier or other courier who also crosses the route from the customer. The aim is to minimize vehicle fixed costs and transportation costs. Where the problem is, each customer will get at least one delivery. capacity limit for each vehicle and determine the number of vehicles to be used in the delivery of goods. To find a solution to this problem, the Integer Linear Programming (ILP) model is used. The solution obtained is an optimal solution that minimizes the objective function and fulfills all constraints or constraints made. The results obtained show that the model created produces a distribution route with a minimum total distance.