OPTIMALISASI RUTE WISATA DI YOGYAKARTA MENGGUNAKAN METODE TRAVELLING SALESMAN PERSON DAN ALGORITMA BRUTE FORCE

Condro Wibawa
{"title":"OPTIMALISASI RUTE WISATA DI YOGYAKARTA MENGGUNAKAN METODE TRAVELLING SALESMAN PERSON DAN ALGORITMA BRUTE FORCE","authors":"Condro Wibawa","doi":"10.56127/jts.v1i3.512","DOIUrl":null,"url":null,"abstract":"Yogyakarta is one of the popular tourist destinations in Indonesia. There are many tourist sites that can be visited in the city of Yogyakarta, including Prambanan Temple, Breksi Cliff, Van den Berg Museum, and Malioboro. For tourists who are not familiar with these tourist sites, determining the route to be visited is important because it will affect travel costs, especially transportation costs. To solve this problem, the Traveling Salesman Person method and the Brute Force Algorithm are used. The Brute Force algorithm was chosen because of its simple characteristics so that it is easy for all people to understand. The results of the research resulted in the most optimal route with a total cost of Rp. 100,300.00 and the least optimal route with a total cost of Rp. 131,000.00.","PeriodicalId":161835,"journal":{"name":"Jurnal Teknik dan Science","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknik dan Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56127/jts.v1i3.512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Yogyakarta is one of the popular tourist destinations in Indonesia. There are many tourist sites that can be visited in the city of Yogyakarta, including Prambanan Temple, Breksi Cliff, Van den Berg Museum, and Malioboro. For tourists who are not familiar with these tourist sites, determining the route to be visited is important because it will affect travel costs, especially transportation costs. To solve this problem, the Traveling Salesman Person method and the Brute Force Algorithm are used. The Brute Force algorithm was chosen because of its simple characteristics so that it is easy for all people to understand. The results of the research resulted in the most optimal route with a total cost of Rp. 100,300.00 and the least optimal route with a total cost of Rp. 131,000.00.
日惹优化旅游路线使用旅行人员和蛮力算法
日惹是印尼最受欢迎的旅游目的地之一。日惹市有许多旅游景点可以参观,包括普兰巴南神庙,布雷克西悬崖,范登伯格博物馆和马里奥博罗。对于不熟悉这些旅游景点的游客来说,确定参观路线是很重要的,因为它会影响旅行成本,尤其是交通成本。为了解决这一问题,使用了旅行推销员人方法和蛮力算法。之所以选择Brute Force算法,是因为它的特点简单,便于所有人理解。研究结果表明,最优路线总成本为100,300.00卢比,最小最优路线总成本为131,000.00卢比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信