Rute Terpendek antar Asrama (Studi Kasus :Yayasan Mamba’ul Ma’arif Denanyar Jombang)

Cynthia Alvionita Ferima; Wiwit Denny Fitriana; Muwathoul Kamalia Aknaafi

Authors

Cynthia Alvionita Ferima Universitas Pesantren Tinggi Darul 'Ulum Jombang
Wiwit Denny Fitriana Universitas Pesantren Tinggi Darul 'Ulum Jombang
Muwathoul Kamalia Aknaafi Universitas Pesantren Tinggi Darul 'Ulum Jombang

Keywords:

Keywords: Graph theory, nearest neighbor, shortest route

Abstract

The data from the Mamba'ul Ma'arif Islamic Boarding School website page is that it houses 16 dormitories with male and female classifications. Some of the important factors include sowan, mineral water delivery, and garbage collection with several different access points. Therefore, of course, it is necessary to consider the shortest route, so that it can save time and minimize the distance to get to the dormitories. Graph theory, which is a branch of mathematics that can be implemented to find the shortest route. Researchers conducted research to determine the shortest route using the nearest neighbor method. The result of the shortest total distance from the implementation of the nearest neighbor method, the shortest route between the Mamba'ul Ma'arif Foundation dormitories Denanyar Jombang, is 1,920 meters. The aim of the results of this study can be used as a reference for the parties concerned to get the shortest route at the Mamba'ul Ma'arif Foundation, Denanyar Jombang.

Downloads

Download data is not yet available.

References

Agus, W.W., dan Wayan, F.M. (2010). Penerapan Algoritma Genetika Pada Sistem Rekomendasi Wisata Kuliner. Jurnal Ilmiah Kursor, 5 (4), 205-211.

Aswar, Wahyuda, Muriani E I. (2014). Penerapan Metode Nearest Neighbour Untuk Menentukan Rute Distribusi Roti Tawar Citarasa Bakery PT KMBU Bontang, Jurnal Teknik Industri Universitas Mulawarman Samarinda.

Febrian,Didi. (2019). Aplikasi Metode Tetangga (nearest Neighbour Alghorithm) terdekat untuk mencari rute terpendek untuk mencari rute terpendek perjalanan wisata museum dan wista religi di kota medan. Karismatika, 5 (1), 1-13.

Ghulam, A.Z. dan Firmanto, H. (2013). Model Konseptual Perencanaan Transportasi Bahan Bakar Minyak (BBM) Untuk Wilayah Kepulauan (Studi Kasus: Kepulauan Kabupaten Semenep). Jurnal Teknik Pomits, 2 (1), 1-5.

Hasanah Faikatun. (2019). Optimisasi Rute Pengangkutan Sampah Di Kabupaten Jombang Dengan Model Penyelesaian Traveling Salesman Problem Menggunakan Algoritma Djikstra. Jombang: Universitas Pesantren Tinggi Darul Ulum Jombang.

Madona Era, Irmansyah Muhammad. (2013). Aplikasi Metode Nearest Neighbor pada Penentuan Jalur Evakuasi untuk Daerah Rawan Gempa dan Tsunami, jurnal electron, 5 (2), 39-46.

Ninik Mutianingsih, U. A. (2016). Membandingkan Dimensi Metrik dan Dimensi Metrik Bintang. Seminar Nasional Matematika FKIP Universitas PGRI Adi Buana, 286 - 296.

Pop, Petrica Claudiu, Zelina, Ioana, Lupse, Vasile, Sitar, Corina Pop, and Chira, Camelia. (2011). Heuristic algorithms for solving the generalized vehicle routing problem. Int. J. Comput. Commun. Control. (Vol. 6, pp.158–165).

Solomon, Marius M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems With Time Window Constraints. Oper. Res. (Vol. 35, pp. 254–265). https://doi.org/10.1287/opre.35.2.254.

Zheng, Weimin, Liao, Zhixue, and Qin, Jing. (2017). Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction. Tour. Manag. 62, pp. 335–349.