This Author published in this journals
All Journal REKA INTEGRA
Cici Herawati, Cici
Institut Teknologi Nasional Bandung

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

USULAN RUTE DISTRIBUSI TABUNG GAS 12 KG MENGGUNAKAN ALGORITMA NEAREST NEIGHBOUR DAN ALGORITMA TABU SEARCH DI PT. X BANDUNG Herawati, Cici; Adianto, Hari; Mustofa, Fifi Herni
REKA INTEGRA Vol 3, No 2 (2015): Edisi Kesepuluh
Publisher : REKA INTEGRA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (454.913 KB)

Abstract

PT. X Bandung merupakan distributor tabung gas 12 Kg. Pendistribusian membutuhkan waktu, ketepatan maupun jumlah. Pendistribusian dapat diselesaikan dengan Vehichle Routing Problem (VRP). Metode VRP yang digunakan adalah metode Nearest Neighbour dengan pemilihan lokasi pelanggan berdasarkan jarak terdekat dari lokasi terakhir yang dikunjungi. Selanjutnya metode perbaikan dengan Tabu Search yang bertujuan mendapatkan waktu minimum dari metode sebelumnya. Berdasarkan data perusahaan saat ini untuk mendistribusikan tabung gas ke 50 pelanggan membutuhkan waktu 889,9 menit. Sedangkan berdasarkan hasil pengolahan data waktu yang dibutuhkan dengan metode Nearest Neighbour adalah 840,7 menit, setelah diperbaiki dengan metode Tabu Search waktu yang dibutuhkan adalah 837,4 menit. Kata kunci: Vehicle Routing Problem, Nearest Neighbour, Tabu Search.   ABSTRACT PT. X Bandung is a distributor of gas tube 12 Kg. The distribution takes time, precision and number. The distribution can be solved by vehichle Routing Problem (VRP). VRP method used is Nearest Neighbour method the customer site selection based on the shortest distance from the last location visited. Further improvements to the Tabu Search method that aims to get the minimum time of previous methods. Based on data from the current company to distribute gas cylinders to 50 customers took 889.9 minutes. While based on the data processing time required by the Nearest Neighbour method was 840.7 minutes, after being repaired by the method of Tabu Search time required is 837.4 minutes. Keywords: Vehicle Routing Problem, Nearest Neighbour, Tabu Search.