Record Details

VEHICLE ROUTING PROBLEM DENGAN APLIKASI METODE NEAREST NEIGHBOR

Journal of Research and Technology

View Archive Info
 
 
Field Value
 
ISSN 2477-6165
2460-5972
 
Authentication Code dc
 
Title Statement VEHICLE ROUTING PROBLEM DENGAN APLIKASI METODE NEAREST NEIGHBOR
 
Added Entry - Uncontrolled Name Prasetyo, Waluyo
Tamyiz, Muchammad
Universitas Nahdlatul Ulama Sidoarjo
Universitas Nahdlatul Ulama Sidoarjo
 
Summary, etc. Transportation problem is just like inventory, this is an activity in logistics area. This activity is possible to make some production in one place and to consume them in another place. The aim of this research were to evaluate the existing network distribution model performance and to provide sugestions to proper the network distribution model used. The applied metode to achieve the goal was Nearest Neighbor Algorithm. The results were: (a) Distance saving was 538,2 Km or 26,59%, (b) Distribution time of product could be reduced to 9,37 hours or 19,07%, (c) Fuel cost could be reduced to 403.650 rupiahs or 26,59%, (d) Driver and assistance cost could be saved to 272.850 rupiahs or 4,5%, and (f) Total of distribution cost could be saved to 676.500 rupiahs or 25,71%. Keywords: Logistics, Distribution, Nearest Neighborhod, Distance, Cost.
 
Publication, Distribution, Etc. 2477 - 6165
 
Electronic Location and Access application/pdf
https://journal.unusida.ac.id/index.php/jrt/article/view/263
 
Data Source Entry Journal of Research and Technology; Vol. 3 No. 2 (2017): JRT Volume 3 No 2 Des 2017
 
Language Note eng
 
Terms Governing Use and Reproduction Note Copyright (c) 2017 Journal of Research and Technology