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

Authors

  • Gusti Eka Yuliastuti Universitas Brawijaya
  • Wayan Firdaus Mahmudy Universitas Brawijaya
  • Agung Mustika Rizki Universitas Brawijaya

DOI:

https://doi.org/10.25126/jitecs.20172122

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.

Author Biography

Wayan Firdaus Mahmudy, Universitas Brawijaya

Faculty of Computer Science

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, 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.

Downloads

Published

2017-06-22

How to Cite

Yuliastuti, G. E., Mahmudy, W. F., & Rizki, A. M. (2017). Implementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City. Journal of Information Technology and Computer Science, 2(1), 1–10. https://doi.org/10.25126/jitecs.20172122

Issue

Vol. 2 No. 1: June 2017

Section

Articles

License

Creative Commons License Creative Common Attribution-ShareAlike 3.0 International (CC BY-SA 3.0)

Authors who publish with this journal agree to the following terms:

  1. 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.
  2. 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.
  3. 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).