Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika

Gusti Eka Yuliastuti, Wayan Firdaus Mahmudy, Agung Mustika Rizki

Abstract


The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP). The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitness value of 1.3291, a population size of 100, the number of generations of 1000, a combination of CR=0,4 and MR=0.6.


Keywords


Rute Perjalanan, Destinasi Wisata, Travelling Salesman Problem (TSP), Fuzzy Time Window

Full Text:

PDF

References


D. Komisioner and O. Jasa, Undang-undang Republik Indonesia Nomor 9 Tahun 1990 Tentang Kepariwisataan. 1990, pp. 1–10.

M. Veenstra, K. J. Roodbergen, I. F. A. Vis, and L. C. Coelho, “The pickup and delivery traveling salesman problem with handling cost,” vol. 257, no. September, pp. 118–132, 2015.

X. Wen, Y. Xu, and H. Zhang, “Computers & Industrial Engineering Online traveling salesman problem with deadline and advanced information,” vol. 63, pp. 1048–1053, 2012.

D. Taş, M. Gendreau, O. Jabali, and G. Laporte, “The traveling salesman problem with time-dependent service times,” Eur. J. Oper. Res., vol. 248, no. 2, pp. 372–383, 2016.

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,” Appl. Soft Comput. J., vol. 32, pp. 154–163, 2015.

I. Kara and T. Derya, “Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows,” Procedia Econ. Financ., vol. 26, no. 15, pp. 1026–1034, 2015.

Y.-Y. Chen, “Fuzzy Flexible Delivery and Pickup Problem with Time Windows,” Procedia Comput. Sci., vol. 17, pp. 379–386, 2013.

R. Roberti and M. Wen, “The Electric Traveling Salesman Problem with Time Windows,” Transp. Res. Part E Logist. Transp. Rev., vol. 89, pp. 32–52, 2016.

K. Karabulut and M. Fatih Tasgetiren, “A variable iterated greedy algorithm for the traveling salesman problem with time windows,” Inf. Sci. (Ny)., vol. 279, pp. 383–395, 2014.

N. Mladenović, R. Todosijević, and D. Urošević, “An efficient GVNS for solving Traveling Salesman Problem with Time Windows,” Electron. Notes Discret. Math., vol. 39, pp. 83–90, 2012.

S. F. Ghannadpour, S. Noori, R. Tavakkoli-Moghaddam, and K. Ghoseiri, “A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application,” Appl. Soft Comput., vol. 14, pp. 504–527, 2014.

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

X. Geng, Z. Chen, W. Yang, D. Shi, and K. Zhao, “Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search,” Appl. Soft Comput. J., vol. 11, no. 4, pp. 3680–3689, 2011.

Y. F. Liao, D. H. Yau, and C. L. Chen, “Evolutionary algorithm to traveling salesman problems,” Comput. Math. with Appl., vol. 64, no. 5, pp. 788–797, 2012.

S.-M. Chen, C.-Y. Chien, S.-M. Chena, and C.-Y. Chiena, “Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques,” Expert Syst. Appl., vol. 38, no. 12, pp. 14439–14450, 2011.

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

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

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,” J. Buana Inform., pp. 1–8, 2014.

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

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

N. D. Priandani and W. F. Mahmudy, “Optimasi Travelling Salesman Problem With Time Windows ( Tsp-Tw ) Pada Penjadwalan Paket Rute Wisata,” Semin. Nas. Sist. Inf. Indones., no. November, pp. 2–3, 2015.

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

M. A. Yaqin and T. Lisbiantoro, “Optimasi Penjadwalan Perkuliahan Jurusan Teknik Informatika Universitas Islam Negeri Maulana Malik Ibrahim Malang Menggunakan Algoritma Genetika dengan Metode Seleksi Rank,” MATICS J. Ilmu Komput. dan Teknol. Inf., vol. 4, no. 5, pp. 191–196, 2012.




DOI: http://dx.doi.org/10.18860/mat.v9i1.4072

Refbacks

  • There are currently no refbacks.




Copyright (c) 2017 Gusti Eka Yuliastuti, Wayan Firdaus Mahmudy, Agung Mustika Rizki

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

_______________________________________________________________________________________________________________

Editorial Office:
Jurusan Teknik Informatika
Fakultas Sains dan Teknologi
Universitas Islam Negeri Maulana Malik Ibrahim Malang
Jalan Gajayana 50 Malang, Jawa Timur, Indonesia 65144
Email: matics@uin-malang.ac.id
_______________________________________________________________________________________________________________

Creative Commons License
This work is licensed under a CC-BY-NC-SA.
© All rights reserved 2015. MATICS , ISSN : 1978-161X | e-ISSN :  2477-2550