This Author published in this journals
All Journal REKA INTEGRA
Ronald Adjie K Situmorang, Ronald Adjie K
Institut Teknologi Nasional Bandung

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

Found 1 Documents
Search

USULAN RANCANGAN RUTE PENDISTRIBUSIAN MINUMAN TEH KEMASAN BOTOL MENGGUNAKAN ALGORITMA NEAREST NEIGHBOUR DAN LOCAL SEARCH Situmorang, Ronald Adjie K; Imran, Arif; Susanty, Susy
REKA INTEGRA Vol 3, No 1 (2015): Edisi Kesembilan
Publisher : REKA INTEGRA

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

Abstract

Penentuan rute kendaraan merupakan salah satu permasalahan yang terjadi pada pendistribusian barang atau produk. PT. SINAR SOSRO adalah perusahaan yang memproduksi bermacam-macam jenis minuman. Saat ini, proses pendistribusian produknya dilakukan berdasarkan pengalaman dan urutan pemesanan produk, sehingga sering terjadi keterlambatan dalam pengiriman. Dalam penelitian ini, diusulkan rancangan rute kendaraan untuk mendistribusikan produk teh kemasan botol menggunakan algoritma Nearest Neighbour sebagai rute awal dan rute tersebut akan dilakukan perbaikan menggunakan metode Local Search sehingga diperoleh waktu tempuh dan jarak tempuh yang minimum. Penelitian ini menghasilkan jarak dan waktu yang lebih pendek dengan selisih waktu 19,1442 menit dan selisih jarak 6,480 km. Kata kunci: Vehicle Routing Problem, Nearest Neighbour, Insertion Intra-Route   ABSTRACT The determination of these vehicles is one of the problems that occur in the distribution of goods or products. PT. SINAR SOSRO is a company that produces various types of beverages. Currently , the distribution of its products is based on experience and the order of ordering the product, so often there is a delay in delivery. In this study, the proposed design of these vehicles to distribute bottled tea products using the Nearest Neighbour algorithm as the initial route and the route will be repaired using Local Search to obtain travel time and mileage minimum.The research resulted in the distance and a shorter time with a gap of 19.1442 minutes and a distance of 6,480 km difference.  Keywords: Vehicle Routing Problem, Nearest Neighbour, Insertion Intra-Route