Implementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City

Author

Gusti Eka Yuliastuti, Wayan Firdaus Mahmudy, Agung Mustika Rizki

Abstract

In doing travel to some destinantions, tourist certainly want to be able to visit many destinations with the optimal scheduling so that necessary in finding the best route and not wasting lots of time travel. Several studies have addressed the problem but does not consider other factor which is very important that is the operating hours of each destination or hereinafter referred as the time window. Genetic algorithm proved able to resolve this travelling salesman problem with time window constraints. Based on test results obtained solutions with the fitness value of 0,9856 at the time of generation of 800 and the other test result obtained solution with the fitness value of 0,9621 at the time of the combination CR=0,7 MR=0,3.

Full Text:

PDF

References


M. Al-Hassan, H. Lu, and J. Lu, “A semantic enhanced hybrid recommendation approach: A case study of e-Government tourism service recommendation system,” Decision Support System, vol. 72, pp. 97–109, 2015.

A. W. Widodo and W. F. Mahmudy, “Penerapan Algoritma Genetika pada Sistem Rekomendasi Wisata Kuliner,” Jurnal Ilmiah Kursor, vol. 5, no. 4, pp. 205–211, 2010.

Universitas Brawijaya, “DASAR-DASAR Algoritma Evolusi,” Universitas Brawijaya, 2016.

D. A. Suprayogi, W. F. Mahmudy, and M. T. Furqon, “Penerapan Algoritma Genetika Traveling Salesman Problem with Time Window : Studi Kasus Rute Antar Jemput Laundry,” Jurnal Buana Informatika, pp. 1–8, 2014.

F. Y. Saptaningtyas, “Optimasi Pengelolaan Pariwisata di DIY dengan Menggunakan Metode Campbell Dudeck Smith (CDS),” Seminar Nasional Matematika dan Pendidikan Matematika, November, pp. 978–979, 2013.

J. B. Escario, J. F. Jimenez, and J. M. Giron-sierra, “Expert Systems with Applications Ant Colony Extended : Experiments on the Travelling Salesman Problem,” Expert System with Applications, vol. 42, pp. 390–410, 2015.

J. Brito, F. J. Martínez, J. A. Moreno, and J. L. Verdegay, “An ACO hybrid metaheuristic for close – open vehicle routing problems with time windows and fuzzy constraints,” Applied Soft Computing, vol. 32, pp. 154–163, 2015.

G. Dong, W. W. Guo, and K. Tickle, “Solving the traveling salesman problem using cooperative genetic ant systems,” Expert System with Applications, vol. 39, no. 5, pp. 8006–5011, 2012.

B. D. Setiawan and A. Pinandito, “Optimasi Kunjungan Objek Wisata dengan Menggunakan Algoritma Genetika,” in Prosiding Seminar Nasional Teknologi dan Rekayasa Informasi 2016, 2016, p. 71.

S. Maity, A. Roy, and M. Maiti, “A Modified Genetic Algorithm for solving Uncertain Constrained Solid Travelling Salesman Problems,” Computers and Industrial Engineering, vol. 83, pp. 273–296, 2015.

M. J. Arnesen, M. Gjestvang, X. Wang, K. Fagerholt, K. Thun, and J. G. Rakke, “A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping,” Computer and Operations Research, vol. 77, pp. 20–31, 2017.

N. D. Priandani and W. F. Mahmudy, “Optimasi Travelling Salesman Problem With Time Windows ( Tsp-Tw ) Pada Penjadwalan Paket Rute Wisata,” Seminar Nasional Sistem Informasi Indonesia, November, pp. 2–3, 2015.

I. Mutakhiroh, F. Saptono, N. Hasanah, and R. Wiryadinata, “Pemanfaatan Metode Heuristik Dalam Pencarian Jalur,” Pemanfaat. Metod. Heuristik dalam pencarian jalur terpendek dengan Algoritma semut dan Algoritma Genetika, Seminar Nasional Aplikasi Teknologi Informasi, SNATI, 2007.




DOI: http://dx.doi.org/10.25126/jitecs.20172122