SOLUTION OF VEHICLE ROUTING PROBLEM WITH MULTIPLE TRIPS, SPLIT DELIVERY, MULTIPLE PRODUCTS, MULTIPLE COMPARTMENTS, AND TIME WINDOWS USING GENETIC ALGORITHM

• Main Author: MUTHIA NIM : 23415016, METHA
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/28870
• Institution: Institut Teknologi Bandung

Distribution system planning is needed to improve efficiency in the company's operational activities. This can be achieved by determining the number of fleet usage and the exact route, commonly called as Vehicle Routing Problem (VRP). This research has developed mathematical model and problem solving algorithm in VRP with multiple trips, split delivery, multiple products, multiple compartments, and time windows (VRP-MTSDMPCTW). The model in this research is used in the distribution of fuel PT. Pertamina in NTT and Timor Leste. <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> Objective function of mathematical formulation in this research is to minimize trip <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> cost during planning horizon by minimizing the number of vehicles and total travel time to serve all customer requests. The model in this research solved by using two stages of the solution construction. The first stage is to use the algorithm called Sequential Insertion (SI) to obtain an initial feasible solution. The second stage is to improve the initial solution with Genetic Algorithm (GA) to obtain the best solution using mutation and crossover operators. <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> The developed algorithm is able to produce solution 81,72% faster than the analytical calculation. For the objective function, the developed algorithm is able to produce a solution approaching the optimal solution with gap 1.14%.