Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

TRAVELING SALESMAN PROBLEM INTEGRATED WITH FUZZY LOGIC ON TOURISM IN D.I. YOGYAKARTA

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · pp. 3087–3104

DOI
10.30598/barekengvol19iss4pp3087-3104
ISSN
2615-3017, 1978-7227
Published
2025-09-01
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

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.

Collaboration network of the authors

8 authors · 12 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Dewi AnggrainiAffiliation unknown1
Dewi Sri SusantiAffiliation unknown1
Na'imah HijriatiAffiliation unknown1
Indah Emilia WijayantiAffiliation unknown1
Dian Ariesta YuwaningsihAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">TRAVELING SALESMAN PROBLEM INTEGRATED WITH FUZZY LOGIC ON TOURISM IN D.I. YOGYAKARTA</dc:title>
	<dc:creator>Mukminin, Uskar Sabilil</dc:creator>
	<dc:creator>Yulianti, Irma Sari</dc:creator>
	<dc:creator>Surodjo, Budi</dc:creator>
	<dc:description xml:lang="en-US">The optimization of tourist travel routes has become a crucial factor in enhancing travel efficiency, reducing costs, and optimizing the overall tourist experience.&amp;nbsp; 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.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18532</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp3087-3104</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 3087-3104</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18532/11127</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Uskar Sabilil Mukminin, Irma Sari Yulianti, Budi Surodjo</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>