MODEL AND TABU SEARCH IMPLEMENTATION FOR VEHICLE ROUTING PROBLEM ON LUBRICANT PRODUCTS DISTRIBUTION AT PT SAMUDRA JAYA SEGARA

PT Samudra Jaya Segara is one of PT Pertamina Lubricants’ authorized distributors with 597 customers for Depok territory. Total number of vehicles for shipping is four, each with its own capacity and specification. The existing method for route planning is clustering consumers into zones utilizing n...

Full description

Saved in:
Bibliographic Details
Main Author: Rahmah Syah Ramdani, Nur
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/46504
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
Description
Summary:PT Samudra Jaya Segara is one of PT Pertamina Lubricants’ authorized distributors with 597 customers for Depok territory. Total number of vehicles for shipping is four, each with its own capacity and specification. The existing method for route planning is clustering consumers into zones utilizing number of vehicles available and then sort consumers in each route based on the closest distance. The routes formed from number of zones have caused inefficient use of vehicle numbers, operational hours and capacities in which there is so much space left. Therefore the company needs a better method for distribution route planning, consumer sequence for delivering and which vehicle to use in each chosen route so that it will minimize company’s total transportation cost. Distribtion route planning problem in PT Samudra Jaya Segara is considered as Heterogeneous Fleet Vehicle Routing Problem with Fixed and Variable Cost (HVRPFV) with additional accesibility constraint in which some consumers can only be served by certain vehicle. In this research, to solve the problem mentioned above, sequal insertion construction algorithm is used, then is improved by using metaheuristic tabu search algorithm. This algorithm is implemented by using VBA Microsoft Excel software. Model and implementation of this algorithm can deliver solution for company’s distribution route, consumers sequence for delivering and which vehicle to use in each choosen route. Thorugh this metaheuristic, the result can minimize company’s total transportation cost by 44% in average, and total distance traveled by 30% in average, compared to existing condition. Moreover, the metaheuristic results in more efficient use of vehicle numbers and operational hours compared to the existing condition.