Open AccessMinimasi Jalur Distribusi di PT. XYZ dengan Metode Improved Cluster First Route Second
Author(s) -
Agung Chandra,
Bambang Setiawan
Publication year - 2021
Publication title -
metris
Language(s) - English
Resource type - Journals
eISSN - 2808-4810
pISSN - 1411-3287
DOI - 10.25170/metris.v20i1.2377
Subject(s) - vehicle routing problem , cluster (spacecraft) , solver , computer science , distribution center , routing (electronic design automation) , mathematical optimization , mathematics , computer network , business , commerce
Reducing distance in delivery service from distribution center to subsidiaries can be reached through well-managed routing which known as VRP - Vehicle Routing Problem. This study was conducted in a food industry PT. XYZ. Two methods, Cluster First Route Second algorithm and linier programming were used to obtain the minimum distance between distribution center to outlets in Jabodetabek area. The cluster first route second method was improved using linier programming – solver. The improved method shows 774.18 kilometer is better than Cluster Firs Route Second, 832.19 kolometer which is 6.97% shortened.