Claim Missing Document
Check
Articles

Found 2 Documents
Search

Determination of Optimal Route for Newspaper Distribution Using Sweep Algorithm and Nearest Neighbour Method: Case Study Anisa Agustina; Ayu Setiawati; Muhammad Iqbalnur; Virda Hersy Lutviana Saputri; Wahyudi Sutopo; Yuniaristanto Yuniaristanto
JRSI (Jurnal Rekayasa Sistem dan Industri) Vol 9 No 01 (2022): Jurnal Rekayasa Sistem & Industri - Juni 2022
Publisher : School of Industrial and System Engineering, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/jrsi.v9i01.526

Abstract

Secara umum permasalahan produksi dan distribusi dalam rantai pasok kertas adalah integrasi rencana untuk meminimalkan total biaya. Waktu pengiriman yang dituntut untuk cepat, terkadang tidak terpenuhi karena permasalahan proses produksi maupun distribusi. Permasalahan pada perusahaan surat kabar di Surakarta salah satunya adalah lambatnya proses pendistribusian akibat penentuan jalur distribusi yang salah. Artikel ini bertujuan untuk memecahkan masalah penentuan jalur perusahaan surat kabar di Kota Surakarta dengan membandingkan dua alternatif pilihan, dimana alternatif pertama menggunakan dua armada dan alternatif kedua menggunakan tiga armada. Penilitian ini menggunakan Algoritma Sweep dan metode Nearest Neighbour agar tercapai minimalisasi waktu dan biaya serta untuk menentukan jalur pengiriman yang terbaik. Dari hasil pengolahan data yang dilakukan, didapatkan bahwa usulan terbaik adalah alternatif pertama, yaitu dengan menggunakan dua armada karena jarak tempuh yang dilalui lebih pendek dengan selisih 0,45 km dan menghasilkan penghematan sebesar Rp 467.940,00 setiap bulannya.
Determination of Optimal Route for Newspaper Distribution Using Sweep Algorithm and Nearest Neighbour Method: Case Study Anisa Agustina; Ayu Setiawati; Muhammad Iqbalnur; Virda Hersy Lutviana Saputri; Wahyudi Sutopo; Yuniaristanto
Jurnal Rekayasa Sistem & Industri Vol 9 No 01 (2022): Jurnal Rekayasa Sistem & Industri
Publisher : School of Industrial and System Engineering, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/jrsi.v9i01.526

Abstract

In general, the problem of production and distribution in the paper supply chain is the integration of plansto minimize total costs. Delivery times are required to be fast, sometimes not fulfilled due to problems inthe production and distribution process. One of the problems with newspaper companies in Surakarta is theslow distribution process due to the determination of the wrong distribution channel. This article aims tosolve the problem of determining the route of a newspaper company in the city of Surakarta by comparingtwo alternative choices, where the first alternative uses two fleets and the second alternative uses threefleets. This research uses the Sweep Algorithm and the Nearest Neighbor method in order to minimizetime and cost and to determine the best delivery path. From the results of data processing, it was found thatthe best proposal was the first alternative, namely by using two fleets because the distance traveled wasshorter with a difference of 0.45 km and resulted in savings of Rp. 467,940.00 every month.