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

  • Yunus M
  • Rumlaklak R
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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

Cite

CITATION STYLE

APA

Yunus, M., & Rumlaklak, R. M. T. (2018). OPTIMASI WAKTU EKSEKUSI PENENTUAN RUTE MENUJU OBYEK WISATA DI MALANG RAYA DENGAN ALGORITMA GENETIKA. Jurnal Teknologi Informasi, 29–40. https://doi.org/10.36382/jti-tki.v9i1.307

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free