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}
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 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.