Implementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City
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.
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, 2015.
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.
How to Cite
Â Creative Common Attribution-ShareAlike 3.0 International (CC BY-SA 3.0)
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).