The best route determination using nearest neighbor approach
DOI:
https://doi.org/10.12928/ijio.v1i1.1423Keywords:
Nearest neighbor, Heuristic optimization, Garbage freight, Route determination, Operational timeAbstract
This research constitutes an application of heuristic optimization using the nearest neighbor (NN) method. It is a method used to design a route based on the next closest distance. The case here is the garbage freight of Yogyakarta City which becomes one of the Environmental Services Department duties. The sector of this research object is Malioboro-Kranggan because it has the highest number of TPS locations. There are 34 TPS locations, and 2 depots with an average volume of total garbage are 197 m3/day. Several alternative routes have resulted because the same distance was found when deciding the next distance (TPS 26 and TPS 31). The best alternative was determined based on the best scenario parameter of total mileage and operational time. The first scenario chose the garbage volume that is close to the remaining capacity, meanwhile, the second scenario chose the smallest garbage volume. At TPS 27, an alternative with the same closest distance appeared again (TPS 15 and TPS 18). Hence, the whole algorithm results in four alternative decisions. The first alternative results 13.59 hours as the total time and 40.092 km as the total distance, the second results 13.50 hours with 40.315 km, the third results 13.57 hours with 41.393 km, and the fourth results 13.803 hours with 40.41 km. The best alternative goes to the first alternative based on the parameter set before. It means that the scenario taken is by choosing the TPS with the closest remaining volume of the vehicle.
References
Badan Standarsisasi Nasional Indonesia (SNI) 19-2454-2002. (2019). Tata cara teknik operasional pengelolaan sampah perkotaan.
Braekers, et al. (2016). The Vehicle Routing Problem: State of The Art Classification and Review. Computers and Industrial Engineering, 99, 300-313.
Fadhlillah, et al. (2015). Analisis dan Implementasi Klasifikasi K-Nearest Neighbor (K-Nn) pada Sistem Identifikasi Biometrik Telapak Kaki Manusia. E-Proceeding of Engineering, 2(2), 2876-2878-2888.
Fatharani, et.al. (2013). Penentuan Rute Kendaraan Pengangkutan Sampah dengan Mengguanakn Metode Nearest Neighbour (Studi Kasus PD Kebersihan Kota Bandung). Reka Integra Journal Online Institut Teknologi Nasional, 1(1), 22-32.
Herawati, et al. (2015). Usulan Rute Distribusi Tabung Gas 12 kg Menggunakan Algoritma Nearest Neighbor dan Algoritma Tabu Search Di PT. X Bandung: Reka Integra Jurnal Online Institut Teknologi Nasional, 2(3), 209-220.
Kurniawati, Dian. (2015). Penentuan Rute Pendistribusisn Gas LPG dengan Metode Algoritma Nearest Neighbour (Studi Kasus pada PT Graha Gas Niaga Klaten). Magister Teknik Sipil. Sekolah Pasca Sarjana. Universitas Muhammadiyah Surakarta.
Lubis, et al. (2016). Penerapan Konsep Vehicle Routing Problem dalam Kasus Pengangkutan Sampah di Perkotaan. Jurnal Teknik Sipil, 23(3), 213-222.
Luo et al. (2020). Non-Numerical Nearest Neighbor Classifiers with Value-Object Hierarchical Embedding. Expert Systems with Applications, 150, 107082, doi:10.1016/j.patcog.2019.107082
Muriani, Aswar Wahyuda. (2014). Penerapan Metode Nearest Neighbour untuk Menentukan Rute Distribusi Roti Tawar Citarasa Bakery PT KMBU Bontang. Fakultas Teknik Industri. Universitas Mulawarman Samarinda.
Pan et al. (2020). A New Fast Search Algorithm for Exact K-Nearest Neighbors Based on Optimal Triangle-Inequality-Based Check Strategy. Knowledge-Based Systems, 189, 105088. doi:10.1016/j.knosys.2019.105088
Peraturan Daerah Kota Yogyakarta Nomor 10 Tahun 2012 tentang Pengelolaan Sampah.
Sumarlin. (2015). Implementasi Algoritma K-Nearest Neighbor Sebagai Pendukung Keputusan Klasifikasi Penerima Beasiswa PPA dan BBM. Jurnal Sistem Informasi Bisnis, 01(2015), 52-61.
Downloads
Published
How to Cite
Issue
Section
License
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal. Please also carefully read the International Journal of Industrial Optimization (IJIO) Author Guidelines at http://journal2.uad.ac.id/index.php/ijio/about/submissions#onlineSubmissions
- That it is not under consideration for publication elsewhere,
- That its publication has been approved by all the author(s) and by the responsible authorities tacitly or explicitly of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with the International Journal of Industrial Optimization (IJIO) agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
1.png)
