PERBANDINGAN METODE NEAREST NEIGHBOR HEURISTIC DAN SEQUENTIAL INSERTION HEURISTIC UNTUK PERANCANGAN RUTE DISTRIBUSI BUAH DAN SAYUR DI PT. BIMANDIRI AGRO SEDAYA

Purnama, Anggi Widya and Nurhakim, Muhammad Lukman (2020) PERBANDINGAN METODE NEAREST NEIGHBOR HEURISTIC DAN SEQUENTIAL INSERTION HEURISTIC UNTUK PERANCANGAN RUTE DISTRIBUSI BUAH DAN SAYUR DI PT. BIMANDIRI AGRO SEDAYA. Jurnal Manajemen Logistik dan Transportasi, 6 (1). pp. 33-51. ISSN 2442-9341

[img] Text
Vol 6 No.1 - Artikel 4 Anggi, Lukman.pdf
Download (281kB)

Abstract

ABSTRAK Ketepatan waktu dan jumlah serta efisiensi pendistribusian tidak mungkin tercapai tanpa adanya dengan perencanaan distribusi, salah satunya adalah penentuan rute kendaraan yang digunakan untuk proses pendistribusian. PT. Bimandiri Agro Sedaya. Perusahaan merupakan perusahaan yang mendistribusikan berbagai macam jenis buah dan sayuran yang terletak di kawasan Lembang, Kabupaten Bandung Barat. Penelitian ini mencoba mengkaji apakah sistem pendistribusian/ pengiriman yang diterapkan PT. Bimandiri Agro Sedaya sudah efektif dan efisien, hal ini dilihat dari variabel jarak tempuh dan biaya pendistribusian/ pengiriman yang dilakukan dengan cara membandingkan metode pendistribusian/ pengiriman eksisting dengan metode nearest neighbor heuristic dan sequential insertion heuristic. Jika dilihat dari segi efektifitas, penentuan rute dengan metode pendistribusian/pengiriman eksisting, metode nearest neighbor heuristic dan sequential insertion heuristic mempunyai nilai efektifitas yang sama, dimana permintaan pendistribusian/ pengiriman buah dan sayuran dapat terpenuhi seluruhnya. Jika dilihat dari segi efisiensi jarak tempuh dan biaya, metode nearest neighbor heuristic lebih efisien dibandingkan dengan metode sequential insertion heuristic, dimana dengan menggunakan metode nearest neighbor heuristic dapat menghemat total jarak tempuh sebesar 127,6 Km atau sekitar 14% dan biaya sebesar Rp. 395.303,- atau sekitar 9% setiap minggunya. Sedangkan dengan metode sequential insertion heuristic (SI) hanya dapat menghemat total jarak tempuh sebesar 104,8 Km atau sekitar 12% dan biaya sebesar Rp. 363.483,- atau sekitar 9% setiap minggunya. Sehingga dengan menggunakan metode nearest neighbor heuristic dapat lebih menghemat total jarak tempuh sebesar 22,8 Km atau sekitar 2% dan biaya sebesar Rp. 31.820,- atau sekitar 1% jika dibandingkan dengan menggunakan metode sequential insertion heuristic. Kata Kunci: Rute Distribusi, Biaya Transportasi, Capacitated Vehicle Routing Problem with Time Windows, Nearest Neighbor Heuristic, Sequential Insertion Heuristic ABSTRACT Timeliness and amount and distribution efficiency cannot be achieved without distribution planning, one of which is determining the vehicle route used for the distribution process. PT. Bimandiri Agro Sedaya. The company is a company that distributes various types of fruits and vegetables located in Lembang, West Bandung Regency. This study tries to examine whether the distribution/ shipping system implemented by PT. Bimandiri Agro Sedaya is already effective and efficient, this can be seen from the distance and distribution/ shipping costs by comparing the existing distribution/ shipping methods with the nearest neighbor heuristic and sequential insertion heuristic methods. When viewed in terms of effectiveness, determining the route with the existing distribution/ shipping method, nearest neighbor heuristic and sequential insertion heuristic methods have the same effectiveness value, where the demand for the distribution/ delivery of fruit and vegetables can be fulfilled entirely. When viewed in terms of mileage and cost efficiency, the nearest neighbor heuristic method is more efficient than the sequential heuristic insertion method, where using the nearest neighbor heuristic method can save a total mileage of 127.6 Km or about 14% and a cost of Rp. 395,303, - or about 9% every week. Whereas with the sequential insertion heuristic (SI) method it can only save a total mileage of 104.8 Km or around 12% and a cost of Rp. 363,483, - or about 9% every week. So that using the nearest neighbor heuristic method can further save a total mileage of 22.8 Km or about 2% and a fee of Rp. 31,820, - or about 1% when compared using the sequential heuristic insertion method. Keywords: Distribution Routes, Transportation Costs, Capacitated Vehicle Routing Problems with Time Windows, Nearest Neighbor Heuristic, Sequential Insertion Heuristic

Item Type: Article
Subjects: H Social Sciences > H Social Sciences (General)
H Social Sciences > HD Industries. Land use. Labor
H Social Sciences > HE Transportation and Communications
Depositing User: Unnamed user with email [email protected]
Date Deposited: 16 Feb 2022 04:16
Last Modified: 16 Feb 2022 04:16
URI: http://eprint.ulbi.ac.id/id/eprint/31

Actions (login required)

View Item View Item
Repositori Stimlog is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.