TRAVELING SALESMAN PROBLEM INTEGRATED WITH FUZZY LOGIC ON TOURISM IN D.I. YOGYAKARTA
Abstract
The optimization of tourist travel routes has become a crucial factor in enhancing travel efficiency, reducing costs, and optimizing the overall tourist experience. This study focuses on the innovative integration of fuzzy logic with the Traveling Salesman Problem (TSP) to determine the optimal path for visiting several major tourist destinations in the Special Region of Yogyakarta, a methodological approach not previously explored in existing literature. Initially, we perform data fuzzification, followed by fuzzy inference, to obtain fuzzy outputs. These output values are subsequently used to determine the shortest route using TSP. Several algorithms are utilized, including Minimum Spanning Tree (MST) and Nearest Neighbor (NN). The results show that the Prim algorithm in MST generates the most optimal route, with a travel distance of 223.1 km and a travel time of 442 minutes. Integrating fuzzy logic into the TSP framework effectively addresses uncertainties in distance and time, offering a solid foundation for improved travel route planning.
Downloads
References
D. Bandara, “AN APPLICATION TO THE TRAVELLING SALESMAN PROBLEM,” Operations Research and Applications : An International Journal, vol. 4, no. 3/4, pp. 09–20, Nov. 2017, doi: https://doi.org/10.5121/oraj.2017.4402.
T. Narwadi and Subiyanto, “AN APPLICATION OF TRAVELING SALESMAN PROBLEM USING THE IMPROVED GENETIC ALGORITHM ON ANDROID GOOGLE MAPS,” in AIP Conference Proceedings, American Institute of Physics Inc., Mar. 2017. doi: https://doi.org/10.1063/1.4976899.
T. Hao, W. Yingnian, Z. Jiaxing, and Z. Jing, “STUDY ON A HYBRID ALGORITHM COMBINING ENHANCED ANT COLONY OPTIMIZATION AND DOUBLE IMPROVED SIMULATED ANNEALING VIA CLUSTERING IN THE TRAVELING SALESMAN PROBLEM (TSP),” PeerJ Comput Sci, vol. 9, no. 1, pp. 1–31, Oct. 2023, doi: https://doi.org/10.7717/peerj-cs.1609.
İ. Küçükoğlu, R. Dewil, and D. Cattrysse, “HYBRID SIMULATED ANNEALING AND TABU SEARCH METHOD FOR THE ELECTRIC TRAVELLING SALESMAN PROBLEM WITH TIME WINDOWS AND MIXED CHARGING RATES,” Expert Syst Appl, vol. 134, no. 1, pp. 279–303, May 2019, doi: https://doi.org/10.1016/j.eswa.2019.05.037.
G. Soares, T. Bulhões, and B. Bruck, “AN EFFICIENT HYBRID GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM WITH RELEASE DATES,” Eur J Oper Res, vol. 318, no. 1, pp. 31–42, Oct. 2024, doi: https://doi.org/10.1016/j.ejor.2024.05.010.
M. Rabbani, H. Farrokhi-Asl, and H. Rafiei, “A HYBRID GENETIC ALGORITHM FOR WASTE COLLECTION PROBLEM BY HETEROGENEOUS FLEET OF VEHICLES WITH MULTIPLE SEPARATED COMPARTMENTS,” Journal of Intelligent and Fuzzy Systems, vol. 30, no. 3, pp. 1817–1830, Mar. 2016, doi: https://doi.org/10.3233/IFS-151893.
A. Di Placido, C. Archetti, and C. Cerrone, “A GENETIC ALGORITHM FOR THE CLOSE-ENOUGH TRAVELING SALESMAN PROBLEM WITH APPLICATION TO SOLAR PANELS DIAGNOSTIC RECONNAISSANCE,” Comput Oper Res, vol. 145, Sep. 2022, doi: https://doi.org/10.1016/j.cor.2022.105831.
Muren, J. Wu, L. Zhou, Z. Du, and Y. Lv, “MIXED STEEPEST DESCENT ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM AND APPLICATION IN AIR LOGISTICS,” Transp Res E Logist Transp Rev, vol. 126, pp. 87–102, Jun. 2019, doi: https://doi.org/10.1016/j.tre.2019.04.004.
A. Gharehgozli, C. Xu, and W. Zhang, “HIGH MULTIPLICITY ASYMMETRIC TRAVELING SALESMAN PROBLEM WITH FEEDBACK VERTEX SET AND ITS APPLICATION TO STORAGE/RETRIEVAL SYSTEM,” Eur J Oper Res, vol. 289, no. 2, pp. 495–507, Mar. 2021, doi: https://doi.org/10.1016/j.ejor.2020.07.038.
Z. Zhang and J. Yang, “A DISCRETE CUCKOO SEARCH ALGORITHM FOR TRAVELING SALESMAN PROBLEM AND ITS APPLICATION IN CUTTING PATH OPTIMIZATION,” Comput Ind Eng, vol. 169, Jul. 2022, doi: https://doi.org/10.1016/j.cie.2022.108157.
S. Bock, S. Bomsdorf, N. Boysen, and M. Schneider, “A SURVEY ON THE TRAVELING SALESMAN PROBLEM AND ITS VARIANTS IN A WAREHOUSING CONTEXT,” Eur J Oper Res, vol. 322, no. 4, pp. 1–14, Apr. 2024, doi: https://doi.org/10.1016/j.ejor.2024.04.014.
M. Husain Anwar and M. Furqan, “DECISION SUPPORT SYSTEM FOR SELECTION OF SCHOLARSHIP RECIPIENT STUDENTS USING TSUKAMOTO METHOD FUZZY LOGIC,” International Journal of Information System & Technology Akreditasi, vol. 8, no. 158, pp. 6–11, Apr. 2024, doi: https://doi.org/10.30645/ijistech.v8i1.341.
U. S. Mukminin, B. Irawanto, B. Surarso, and Farikhin, “VEHICLE ROUTING PROBLEM ON DYNAMIC PROGRAMMING USING FUZZY LOGIC APPROACH FOR TOURIST DESTINATION ROUTE IN SEMARANG,” in AIP Conference Proceedings, American Institute of Physics Inc., Jun. 2023. doi: https://doi.org/10.1063/5.0140408.
G. Kim, “DYNAMIC VEHICLE ROUTING PROBLEM WITH FUZZY CUSTOMER RESPONSE,” Sustainability (Switzerland), vol. 15, no. 5, Mar. 2023, doi: https://doi.org/10.3390/su15054376.
R. Almahasneh, B. Tüú-Szabó, L. T. Kóczy, and P. Földesi, “OPTIMIZATION OF THE TIME-DEPENDENT TRAVELING SALESMAN PROBLEM USING INTERVAL-VALUED INTUITIONISTIC FUZZY SETS,” Axioms, vol. 9, no. 2, Jun. 2020, doi: https://doi.org/10.3390/axioms9020053.
S. Trigui, O. Cheikhrouhou, A. Koubaa, U. Baroudi, and H. Youssef, “FL-MTSP: A FUZZY LOGIC APPROACH TO SOLVE THE MULTI-OBJECTIVE MULTIPLE TRAVELING SALESMAN PROBLEM FOR MULTI-ROBOT SYSTEMS,” Soft comput, vol. 21, no. 24, pp. 7351–7362, Dec. 2017, doi: ttps://doi.org/10.1007/s00500-016-2279-7.
T. Yang, W. Wang, and Q. Wu, “FUZZY DEMAND VEHICLE ROUTING PROBLEM WITH SOFT TIME WINDOWS,” Sustainability (Switzerland), vol. 14, no. 9, May 2022, doi: https://doi.org/10.3390/su14095658.
R. Saatchi, “FUZZY LOGIC CONCEPTS, DEVELOPMENTS AND IMPLEMENTATION,” Information (Switzerland), vol. 15, no. 10, Oct. 2024, doi: https://doi.org/10.3390/info15100656.
M. S. Rahman and M. H. Ali, “ADAPTIVE NEURO FUZZY INFERENCE SYSTEM (ANFIS)-BASED CONTROL FOR SOLVING THE MISALIGNMENT PROBLEM IN VEHICLE-TO-VEHICLE DYNAMIC WIRELESS CHARGING SYSTEMS,” Electronics (Switzerland), vol. 14, no. 3, Feb. 2025, doi: https://doi.org/10.3390/electronics14030507.
F. S. Aisyah, W. Winarno, and D. N. Rinaldi, “OPTIMIZING CARTON PRODUCT DELIVERY BY SOLVING TRAVELLING SALESMAN PROBLEM AT PACKAGING COMPANIES,” BAREKENG: Jurnal Ilmu Matematika dan Terapan, vol. 18, no. 3, pp. 1803–1816, Aug. 2024, doi: https://doi.org/10.30598/barekengvol18iss3pp1803-1816.
S. M. H. Al Kafaji and M. A. K. Shiker, “OPTIMIZING THE MINIMUM SPANNING TREE (MST) AND ITS RELATIONSHIP WITH THE MINIMUM CUT,” Int J Health Sci (Qassim), vol. 6, no. 6, pp. 9347–9360, Sep. 2022, doi: https://doi.org/10.53730/ijhs.v6nS6.12436.
S. Hougardy and M. Wilde, “ON THE NEAREST NEIGHBOR RULE FOR THE METRIC TRAVELING SALESMAN PROBLEM,” Discrete Appl Math (1979), vol. 195, no. 1, pp. 101–103, Apr. 2015, doi: https://doi.org/10.1016/j.dam.2014.03.012.
R. Li, G. Rose, H. Chen, and J. Shen, “EFFECTIVE LONG-TERM TRAVEL TIME PREDICTION WITH FUZZY RULES FOR TOLLWAY,” Neural Comput Appl, vol. 30, no. 9, pp. 2921–2933, Nov. 2018, doi: https://doi.org/10.1007/s00521-017-2899-6.
Copyright (c) 2025 Uskar Sabilil Mukminin, Irma Sari Yulianti, Budi Surodjo
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. 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 websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.
1.gif)
