Optimization of Tourism Route Balkondes Tour in Borobudur using the Greedy Algorithm

Optimization of Tourism Route Balkondes Tour in Borobudur using the Greedy Algorithm

• By Sardiarinto,;
• Seminar Internasional Bereputasi
• 363

In order to support community-based tourism, the Ministry of BUMN launches the Balkondes program or Balai Ekonomi Desa in 2017. The manifestation of the program is tourism in each village in the Borobudur District. At present, there are 20 Balkondes in Borobudur which are ready to be visited besides the Borobudur Temple. Each Balkondes has characteristics and characteristics that differ according to the potential of the Village. So tourists will not feel disadvantaged visiting some or all of the Balkondes. However, often tourists do not have enough time to visit all of the Balkondes. The problem that is often faced by tourists is the limited time of visit. Therefore, to help tourists determine tourist attractions and routes that must be passed to get maximum results an application needs to be made. To determine the route applied Greedy algorithm, then the results are processed to calculate the estimated visit time and travel time. The results of this calculation are then applied to an application called TurBo. This application is designed based on Android to determine several destinations based on the allocation of time owned by tourists. Making it easier for tourists to set more goals with more efficient time.

• Katakunci
• URL https://ieeexplore.ieee.org/abstract/document/8965397
• Penerbit ,

REFERENSI

[1] A. E. Ghozali, B. D. Setiawan, and M. T. Furqon,

“Tourism Planning Application in Malang with

Greedy Algorithm(in Indonesia),” J. Pengemb.

Teknol. Inf. dan Ilmu Komput. Univ. Brawijaya, vol. 1,

no. 12, pp. 1459–1467, 2017.

[2] A. Ambarwari and N. Witdi Yanto, “Application of

Greedy Algorithm to the Knapsack Problem for

Container Transportation Optimization(in Indonesia),”

no. January, 2016.

[3] K. Wang, W. Shang, M. Liu, W. Lin, and H. Fu, “A

Greedy and Genetic Fusion Algorithm for Solving

Course Timetabling Problem,” Proc. - 17th

IEEE/ACIS Int. Conf. Comput. Inf. Sci. ICIS 2018, pp.

344–349, 2018.

[4] D. Rachmawati and A. Candra, “Implement the

Greedy Algorithm to Solve Knapsack Problems(in

Indonesia),” J. SAINTIKOM, vol. 12, no. 3, pp. 185–

192, 2013.

[5] M. Soltys, “Greedy Algorithms,” An Introd. to Anal.

Algorithms, pp. 29–42, 2012.

[6] Alamsyah and I. T. Putri, “Application of Greedy

Algorithms to Vending Machines(in Indonesia),” Sci.

J. Informatics, vol. 1, no. 2, pp. 201–209, 2014.

[7] F. Ilmi, S. Maisari, M. H. Irfani, and A. Siddik,

“Application of Greedy Algorithms in Math Games

(in Indonesia),” Sci. J. Informatics, vol. 1, no. 2, pp.

1–11, 2015.

[8] S. Bouamama and C. Blum, “On solving large-scale

instances of the knapsack problem with setup by

means of an iterated greedy algorithm,” 2017 6th Int.

Conf. Syst. Control. ICSC 2017, pp. 342–347, 2017.

[9] Reto Meier, “Professional Android 4 Application

Development. Indianapolis: WROX.,” pp. 513-

565,701-739,95–165, 2012.

[10] A. D. Kasman, Kolaborasi Dahsyat Android Dengan

PHP & MySQL. Yogyakarta, 2013.