KomoTrip:一种基于离散komodo mlipir算法的多日游行程推荐方法。

IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
PeerJ Computer Science Pub Date : 2025-11-12 eCollection Date: 2025-01-01 DOI:10.7717/peerj-cs.3350
Z K Abdurahman Baizal, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan
{"title":"KomoTrip:一种基于离散komodo mlipir算法的多日游行程推荐方法。","authors":"Z K Abdurahman Baizal, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan","doi":"10.7717/peerj-cs.3350","DOIUrl":null,"url":null,"abstract":"<p><p>Technological developments in recent years led to the emergence of increasingly sophisticated recommender systems to support multi-day travel itineraries that fall under the Tourist Trip Design Problem (TTDP). Various problem analogies are widely used to solve TTDP, such as Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Orienteering Problem (OP), and Team Orienteering Problem with Time Windows (TOPTW). For multi-day route recommendation, TOPTW is suitable as a problem analogy since there is a per-day travel duration constraint. So far, TTDP with TOPTW does not consider the weighting (priority level of users) for each requirement attribute in a multi-attribute-based TOPTW to ensure personalized recommendations. In addition, running time remains a challenge in many studies in the TOPTW area. Many metaheuristic algorithms have been adopted to TOPTW for generating a time-efficient approach. Komodo Mlipir Algorithm (KMA) emerges as a new algorithm that promises good scalability. Therefore, we propose KomoTrip, a method that adopts the discrete version of KMA and Multi-Attribute Utility Theory (MAUT) to recommend optimal travel routes per day by accommodating the multi-attribute preferences of users. We perform three evaluation scenarios, <i>i.e</i>., general performance, Degree of Interest (DOI) combinations, and varying numbers of Points of Interest (POI), consistently demonstrating that KomoTrip outperforms several benchmark algorithms in terms of computational time efficiency and also exhibits robust fitness values across different problem dimension scales. Thus, KomoTrip can be regarded as an efficient algorithm to recommend optimal multi-day tour routes, effectively incorporating weighted multi-attribute preferences into its optimization process. We further benchmarked KomoTrip against state-of-the-art TOPTW heuristics on the public Solomon dataset, where it demonstrated competitive profit values, particularly for a larger number of days (tours), and consistently achieved superior runtime performance.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e3350"},"PeriodicalIF":2.5000,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12704617/pdf/","citationCount":"0","resultStr":"{\"title\":\"KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm.\",\"authors\":\"Z K Abdurahman Baizal, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan\",\"doi\":\"10.7717/peerj-cs.3350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Technological developments in recent years led to the emergence of increasingly sophisticated recommender systems to support multi-day travel itineraries that fall under the Tourist Trip Design Problem (TTDP). Various problem analogies are widely used to solve TTDP, such as Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Orienteering Problem (OP), and Team Orienteering Problem with Time Windows (TOPTW). For multi-day route recommendation, TOPTW is suitable as a problem analogy since there is a per-day travel duration constraint. So far, TTDP with TOPTW does not consider the weighting (priority level of users) for each requirement attribute in a multi-attribute-based TOPTW to ensure personalized recommendations. In addition, running time remains a challenge in many studies in the TOPTW area. Many metaheuristic algorithms have been adopted to TOPTW for generating a time-efficient approach. Komodo Mlipir Algorithm (KMA) emerges as a new algorithm that promises good scalability. Therefore, we propose KomoTrip, a method that adopts the discrete version of KMA and Multi-Attribute Utility Theory (MAUT) to recommend optimal travel routes per day by accommodating the multi-attribute preferences of users. We perform three evaluation scenarios, <i>i.e</i>., general performance, Degree of Interest (DOI) combinations, and varying numbers of Points of Interest (POI), consistently demonstrating that KomoTrip outperforms several benchmark algorithms in terms of computational time efficiency and also exhibits robust fitness values across different problem dimension scales. Thus, KomoTrip can be regarded as an efficient algorithm to recommend optimal multi-day tour routes, effectively incorporating weighted multi-attribute preferences into its optimization process. We further benchmarked KomoTrip against state-of-the-art TOPTW heuristics on the public Solomon dataset, where it demonstrated competitive profit values, particularly for a larger number of days (tours), and consistently achieved superior runtime performance.</p>\",\"PeriodicalId\":54224,\"journal\":{\"name\":\"PeerJ Computer Science\",\"volume\":\"11 \",\"pages\":\"e3350\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2025-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12704617/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PeerJ Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.7717/peerj-cs.3350\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.3350","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

近年来的技术发展导致越来越复杂的推荐系统的出现,以支持属于旅游行程设计问题(TTDP)的多日旅行行程。各种各样的问题类比被广泛用于解决TTDP问题,如旅行商问题(TSP)、车辆路线问题(VRP)、定向问题(OP)和带时间窗口的团队定向问题(TOPTW)。对于多日路线推荐,由于存在每日行程时间约束,所以TOPTW适合作为问题类比。到目前为止,使用TOPTW的TTDP没有考虑基于多属性的TOPTW中每个需求属性的权重(用户的优先级),以确保个性化的推荐。此外,在TOPTW领域的许多研究中,运行时间仍然是一个挑战。许多元启发式算法已被采用到TOPTW中,以生成一种时间效率高的方法。Komodo Mlipir算法(KMA)是一种具有良好可扩展性的新算法。因此,我们提出了KomoTrip方法,该方法采用离散版本的KMA和多属性效用理论(MAUT),通过容纳用户的多属性偏好来推荐每天最优的旅行路线。我们执行了三种评估场景,即一般性能、兴趣度(DOI)组合和不同数量的兴趣点(POI),一致地证明KomoTrip在计算时间效率方面优于几种基准算法,并且在不同的问题维度尺度上也表现出稳健的适应度值。因此,KomoTrip可以看作是一种高效的多日游路线推荐算法,它有效地将加权多属性偏好融入到优化过程中。我们进一步将KomoTrip与公共Solomon数据集上最先进的TOPTW启发式方法进行了基准测试,在那里它展示了具有竞争力的利润值,特别是对于更长的天数(旅行),并且始终取得了卓越的运行时性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm.

Technological developments in recent years led to the emergence of increasingly sophisticated recommender systems to support multi-day travel itineraries that fall under the Tourist Trip Design Problem (TTDP). Various problem analogies are widely used to solve TTDP, such as Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Orienteering Problem (OP), and Team Orienteering Problem with Time Windows (TOPTW). For multi-day route recommendation, TOPTW is suitable as a problem analogy since there is a per-day travel duration constraint. So far, TTDP with TOPTW does not consider the weighting (priority level of users) for each requirement attribute in a multi-attribute-based TOPTW to ensure personalized recommendations. In addition, running time remains a challenge in many studies in the TOPTW area. Many metaheuristic algorithms have been adopted to TOPTW for generating a time-efficient approach. Komodo Mlipir Algorithm (KMA) emerges as a new algorithm that promises good scalability. Therefore, we propose KomoTrip, a method that adopts the discrete version of KMA and Multi-Attribute Utility Theory (MAUT) to recommend optimal travel routes per day by accommodating the multi-attribute preferences of users. We perform three evaluation scenarios, i.e., general performance, Degree of Interest (DOI) combinations, and varying numbers of Points of Interest (POI), consistently demonstrating that KomoTrip outperforms several benchmark algorithms in terms of computational time efficiency and also exhibits robust fitness values across different problem dimension scales. Thus, KomoTrip can be regarded as an efficient algorithm to recommend optimal multi-day tour routes, effectively incorporating weighted multi-attribute preferences into its optimization process. We further benchmarked KomoTrip against state-of-the-art TOPTW heuristics on the public Solomon dataset, where it demonstrated competitive profit values, particularly for a larger number of days (tours), and consistently achieved superior runtime performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
PeerJ Computer Science
PeerJ Computer Science Computer Science-General Computer Science
CiteScore
6.10
自引率
5.30%
发文量
332
审稿时长
10 weeks
期刊介绍: PeerJ Computer Science is the new open access journal covering all subject areas in computer science, with the backing of a prestigious advisory board and more than 300 academic editors.
×
引用
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学术官方微信
小红书