PENENTUAN RUTE DISTRIBUSI PUPUK DENGAN
METODE TRAVELLING SALESMAN PROBLEM (TSP)
(STUDI KASUS PT BUNGA TANI LAMONGAN)
Total View This Week0
Total View This Week0
Institusion
Universitas Pembangunan Nasional Veteran Jawa Timur
Author
NI LUH , MAHARIANI
Subject
HF5410 Marketing. Distribution of products
Datestamp
2015-02-13 02:39:59
Abstract :
This research was made based on the existing problems in the fertilizer company called PT. Bunga Tani located in Lamongan, this company isn?t have an optimal route of distribution and frequent occurrence of delay in delivery to a number of agents. Based on these problems then be made using the method of this study Traveling Salesman Problem. The purpose of this study was to plan the distribution of fertilizer to a number of agents to achieve the shortest distance and generate a minimum total distribution costs. The datas were taken by the highest demand on February 2014. And the object of this study is the number of agents of distributors Bunga Tani with highest demand more than 100 cardboard. The variables used are divided into five independent variables, including the initial distribution, the initial cost of distribution, agent location data, the data mileage, and armda used While the dependent variable is the determination of the shortest route in order to minimize distribution costs. From the data processing of route distribution processing using Branch And Bound method can be concluded that the total distance in through the company that is equal to 1703.9 km / week, or 34.078km / month with an efficiency of 1.92% range. With the cost of transportation is issued Rp 47,537,743, - / month. Thus it can be concluded that the method of the Traveling Salesman Problem (Branch and Bound) is better than the beginning of the company with saving methods range of 33.5 km / week and 668 miles / month and cost savings of Rp. 615 395, - / month. Keywords: Travelling Salesman Problem Methods (TSP). Distribution
This research was made based on the existing problems in the fertilizer company called PT. Bunga Tani located in Lamongan, this company isn?t have an optimal route of distribution and frequent occurrence of delay in delivery to a number of agents. Based on these problems then be made using the method of this study Traveling Salesman Problem. The purpose of this study was to plan the distribution of fertilizer to a number of agents to achieve the shortest distance and generate a minimum total distribution costs. The datas were taken by the highest demand on February 2014. And the object of this study is the number of agents of distributors Bunga Tani with highest demand more than 100 cardboard. The variables used are divided into five independent variables, including the initial distribution, the initial cost of distribution, agent location data, the data mileage, and armda used While the dependent variable is the determination of the shortest route in order to minimize distribution costs. From the data processing of route distribution processing using Branch And Bound method can be concluded that the total distance in through the company that is equal to 1703.9 km / week, or 34.078km / month with an efficiency of 1.92% range. With the cost of transportation is issued Rp 47,537,743, - / month. Thus it can be concluded that the method of the Traveling Salesman Problem (Branch and Bound) is better than the beginning of the company with saving methods range of 33.5 km / week and 668 miles / month and cost savings of Rp. 615 395, - / month. Keywords: Travelling Salesman Problem Methods (TSP). Distribution
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
