JURNAL TEKNOLOGI INFORMASI: Teori, Konsep dan Implementasi VOL 9 NO 1 Tahun 2018
Artikel

OPTIMASI WAKTU EKSEKUSI PENENTUAN RUTE MENUJU OBYEK WISATA DI MALANG RAYA DENGAN ALGORITMA GENETIKA

Mahmud Yunus
Teknik Informatika STMIK PPKIA Pradnya Paramita
Ryan Markus Thobias Rumlaklak
Teknik Informatika STMIK PPKIA Pradnya Paramita

Diterbitkan 2018-03-31

Abstrak

As one of the tourist destinations in Indonesia, the area of Malang Raya offers a variety of interesting
tourist attractions. Based on BPS statistics from Kota Batu in 2015, total tourist visits were 2,089,022
people. While the total tourist visit in 2014 in Malang Regency is 2,118,008 people. Data was taken at
22 tourism object in Batu Town and 10 tourism object in Malang Regency. The location of the
destination of several distant attractions, a constraint for tourists to determine the optimal route to the
tourist attraction. One alternative solution to the problem can be done using Genetic Algorithms. The
focus of this research is to build a web based application that can provide information on the order of
route of visits to some tourism objects optimally. Implementation is done based on the completion of
Traveling Salesman Problem, using Genetic Algorithm method. Variable optimization is (1) the
shortest total distance; and (2) application execution time with Brute Force algorithm as a
comparison. The results show that if the location of the chosen destination is numerous, the Genetic
Algorithm is more efficient in the use of time and resources than the Brute Force algorithm.

Referensi

  1. Badan Perencanaan Pembangunan Daerah.
  2. Statistik Pembangunan Daerah
  3. (Kabupaten Malang Dalam Angka) Tahun
  4. Malang: Pemerintah Kabupaten
  5. Malang.
  6. Badan Pusat Statistik Kota Batu. 2015.
  7. Kota Batu dalam Angka 2015. Batu: Badan
  8. Pusat Statistik Kota Batu.
  9. Kusumadewi, S., dkk. 2005. Penyelesaian
  10. Masalah Optimasi dengan Teknik-teknik
  11. Heuristi. Yogyakarta: Graha Ilmu.
  12. Lukas, dkk. 2005. Penerapan Algoritma
  13. Genetika untuk Travelling Salesman
  14. Problem dengan Menggunakan Metode
  15. Order Crossover dan Insertion Mutation
  16. (hlm. 1-5). Seminar Nasional AplikasiTeknologi Informasi
  17. Tahyudin, Imam dan Susanti, Ika. 2015.
  18. Pencarian Rute Terbaik pada Obyek
  19. Wisata di Kabupaten Banyumas
  20. Menggunakan Algoritma Genetika Metode
  21. TSP. JUITA ISSN: 2086-9398, 3 (4): 165173
  22. Alberto J. Urdaneta, Juan F. Gomez, Elmer
  23. Sorrentino, Luis Flores, Ricardo Diaz. “A
  24. Hybrid Genetic Algorithm For Optimal
  25. Reactive Power Planning Based Upon
  26. Successive Linear Programmingâ€. IEEE
  27. Transactions on Power Systems, Vol. 14,
  28. No.42, November 1999.
  29. D.E Goldberg,â€Genetic Algorithm in
  30. Search, Optimization & Machine Learning,†Addison-Wesley Publishing
  31. Company, Inc., Canada, 1989, hlm. 59-86.
  32. Anastasios G. Bakirtzis, Pandel N. Biskas,
  33. Christoforos E. Zoumas, Vasilios Petridis.
  34. “Optimal Power Flow by Enhanced
  35. Genetic Algorithmâ€. IEEE Transactions on
  36. Power Systems, Vol. 17, No.02, May 2002.
  37. N. Sannomiya , H. Iima, “Genetic
  38. algorithm approach to a production
  39. ordering problem in an assembly process
  40. with buffersâ€. Proc. of 7th IFAC &mp. On
  41. Information Control Problems in a
  42. Manufacturing Technology, pp. 403408,1992.
  43. Suyanto, “Algoritma Genetika dalam
  44. MATLABâ€. Yogyakarta: ANDI, 2005,
  45. hlm. 1-2.
  46. T. Sutojo, Edy Mulyanto, Vincent
  47. Suhartono. “Kecerdasan Buatanâ€.
  48. Yogyakarta: CV. ANDI Offset, 2011.