SOLUTION OF VEHICLE ROUTING PROBLEM WITH FLEET MIX VEHICLE, MULTIPLE TRIPS, SPLIT DELIVERY, MULTIPLE PRODUCTS AND MULTIPLE COMPARTMENTS USING GENETIC ALGORITHM TECHNIQUE

• Main Author: BUNGA PAILLIN (NIM: 23407020); Pembimbing: Dr. Suprayogi, ST., MT., DANIEL
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/13356
• Institution: Institut Teknologi Bandung

The high cost of transportation in logistic activities, companies have to make distribution policy more efficient. It may be done by determining the needs of fleets and optimal routes which known as Vehicle Routing Problem (VRP). This thesis explain one of basic variants of VRP with fleet mix vehicle, multiple trips, split delivery, multiple product and multiple compartments in order to minimize the total of routing cost. One obvious case is the distribution of fuel (BBM). As a part of the hard combinatorial problem with NP-hard characteristics, generally VRP can be solved by heuristic approach such as genetic algorithm (GA) technique as using in this thesis. GA technique is start with forming the initial population. Each individual in this population generates by Sequential Insertion technique where the first customer is chosen randomly. Reproduction process engages the genetic operators such: elitism, migration, mutation and crossover. GA technique is tested using nine sets of hypothetic data and also applicable to the real case i.e. distribution of BBM in Maluku province, North Maluku, Papua and West Papua.