Algoritma Genetika Untuk Menentukan Jalur Terpendek Wisata Kota Bukittinggi

Indra Saputra - Matematika, Universitas Negeri Padang
Defri Ahmad - Matematika, Universitas Negeri Padang

Abstract


Abstract — Bukittinggi is a city with many tourist destination, thats close each other. Because of many tourist destination in Bukittinggi makes difficult for the tourist to visit all the places there at the limited time. To solve this problem, we did time and distance data processing between the tourist site around Bukittinggi using a genetic algorithm to find the shortest way for the tourists to reach the destination and be able to visit every place there. The steps for the genetic algorithm are; obtaining data from various sources, completing the Travelling Salesman Problem, calculating the time and distance between each tourist destination, creating the design system from input to output used, analyzing and evaluating the result that has been made by the system to make the most effective route to visit Bukittinggi.

 

Keywords — Tour, Time, Distance, Travelling Salesman Problem, Genetic Algorithm


Full Text:

PDF

References


Dinas Pariwisata Kota Bukittinggi. 2018. http://www.bukittinggikota.go.id/

Dorigo, M. dan Gambardella, L. M. 1996. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. Belgium: Université Libre de Bruxelles

Anggraini, Midona Sri. 2008. Pemanfaatan Algoritma Semut Untuk Menyelesaikan Travelling Salesman Problem (TSP). Tugas Akhir Jurusan Matematika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Negeri Padang.

Almawardi, Ibrohim. 2015. “Algoritma Greedy dan Contoh Programnya”. http://ibrohim-almawardi.blogspot.co.id/2015/05/algoritma-greedy-dan-contoh-progamnya.html.

Haupt, S. 2004. Practical Genetic Algorithm. Willey: New Jersey.

Murniati, R. 2009. Penerapam Algoritma Genetika pada DNA Sequencing by Hibbridization. Depok: Departemen Matematika UI.

Satriyanto, E. 2009. Kecerdasan Buatan. Surabaya: PENS-ITS.

Hasibuan, Medrio Dwi Aksara Cipta. 2015. Pencarian Rute Terbaik Pada Travelling Salesman Problem (TSP) Menggunakan Algoritma Genetika pada Dinas Kebersihan dan Pertamanan Kota Pekanbaru. SATIN - Sains dan Teknologi Informasi, Vol. 1, No. 1, Juni 2015.




DOI: http://dx.doi.org/10.24036/unpjomath.v5i1.8905