VEHICLE ROUTING PROBLEM UNPAIRED PICK-UP AND DELIVERY, SPLIT LOADS, HETEROGENOUS FLEET, TIME WINDOWS,AND MULTI PRODUCTS USING SEQUENTIAL INSERTION ALGORITHM

• Main Author: NIM 23415011 , JUNIWATI
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/28365
• Institution: Institut Teknologi Bandung

Transportation is one of the most important activities in the company that cost much from total cost. The company must find a way to optimize transportation cost by determining vehicle route that can minimize total cost. In this research, the author develop mathematical model and algorithm for vehicle routing problem unpaired pick-up and delivery, split loads, time windows and multi product. <br /> <br /> Model is established to minimize total cost. The decision variables are type of vehicle and route to minimize total cost by reallocating products. Pick-up and delivery point are unpaired beforehand that makes more complex to reallocate products by considering demand and inventory from each retailer and also time windows in activity to minimize penalty cost. <br /> <br /> To obtain optimal solution, Sequential Insertion Algorithm is used get optimal solution. Computation time by using that algorithm is smaller by -99,98% than analytic method to obtain optimal solution and objective function with gap 13,33%.