{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:45:33Z","timestamp":1776336333763,"version":"3.51.2"},"reference-count":40,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:00:00Z","timestamp":1762905600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research and Innovation Agency of the Republic of Indonesia"},{"name":"Research and Innovation for Advanced Indonesia (RIIM) Batch 7 program","award":["47\/IV\/KS\/02\/2025 and 052\/SAM4\/PPM\/2025"],"award-info":[{"award-number":["47\/IV\/KS\/02\/2025 and 052\/SAM4\/PPM\/2025"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>\n                    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,\n                    <jats:italic>i.e<\/jats:italic>\n                    ., 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.\n                  <\/jats:p>","DOI":"10.7717\/peerj-cs.3350","type":"journal-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T08:30:28Z","timestamp":1762936228000},"page":"e3350","source":"Crossref","is-referenced-by-count":1,"title":["KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm"],"prefix":"10.7717","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-9559","authenticated-orcid":true,"given":"Z. K. Abdurahman","family":"Baizal","sequence":"first","affiliation":[{"name":"School of Computing, Telkom University, Bandung, West Java, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soni Fajar Surya","family":"Gumilang","sequence":"additional","affiliation":[{"name":"School of Industrial Engineering, Telkom University, Bandung, West Java, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rio","family":"Nurtantyana","sequence":"additional","affiliation":[{"name":"National Research and Innovation Agency, Bandung, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahmat","family":"Hendrawan","sequence":"additional","affiliation":[{"name":"Telkom Indonesia, Jakarta, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4443","published-online":{"date-parts":[[2025,11,12]]},"reference":[{"key":"10.7717\/peerj-cs.3350\/ref-1","doi-asserted-by":"publisher","first-page":"116877","DOI":"10.1016\/j.eswa.2022.116877","article-title":"CAFOB: context-aware fuzzy-ontology-based tourism recommendation system","volume":"199","author":"Abbasi-Moud","year":"2022","journal-title":"Expert Systems with Applications"},{"issue":"10","key":"10.7717\/peerj-cs.3350\/ref-2","doi-asserted-by":"publisher","first-page":"12439","DOI":"10.1016\/j.eswa.2011.04.025","article-title":"Time-dependent personal tour planning and scheduling in metropolises","volume":"38","author":"Abbaspour","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.7717\/peerj-cs.3350\/ref-3","doi-asserted-by":"publisher","first-page":"105039","DOI":"10.1016\/j.cor.2020.105039","article-title":"Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows","volume":"123","author":"Amarouche","year":"2020","journal-title":"Computers & Operations Research"},{"issue":"5","key":"10.7717\/peerj-cs.3350\/ref-4","doi-asserted-by":"publisher","first-page":"694","DOI":"10.22266\/ijies2024.1031.53","article-title":"Improved whale optimization algorithm with variable neighbourhood search strategy (WOA-VNS) in solving vehicle routing problem (VRP) for recommending multi-days tourist routes in Yogyakarta","volume":"17","author":"Ananda","year":"2024","journal-title":"International Journal of Intelligent Engineering and Systems"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-5","doi-asserted-by":"publisher","first-page":"106954","DOI":"10.1016\/j.cor.2024.106954","article-title":"A large neighborhood search-based approach to tackle the very large scale team orienteering problem in industrial context","volume":"176","author":"Chaigneau","year":"2025","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.7717\/peerj-cs.3350\/ref-7","article-title":"A column generation algorithm for the team orienteering problem with time windows","author":"El-Hajj","year":"2015"},{"issue":"1","key":"10.7717\/peerj-cs.3350\/ref-8","doi-asserted-by":"publisher","first-page":"112160","DOI":"10.1016\/j.knosys.2024.112160","article-title":"Relative distances approach for multi-traveling salesmen problem","volume":"300","author":"Erg\u00fcven","year":"2024","journal-title":"Knowledge-Based Systems"},{"key":"10.7717\/peerj-cs.3350\/ref-9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/ICoDSA58501.2023.10276870","article-title":"Recommendation for scheduling tourist routes using particle swarm optimization (case study of yogyakarta)","author":"Fahlevi","year":"2023"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-10","doi-asserted-by":"publisher","first-page":"e1731","DOI":"10.7717\/peerj-cs.1731","article-title":"Bert-based tourism named entity recognition: making use of social media for travel recommendations","volume":"9","author":"Fudholi","year":"2023","journal-title":"PeerJ Computer Science"},{"issue":"01","key":"10.7717\/peerj-cs.3350\/ref-11","doi-asserted-by":"publisher","first-page":"1950001","DOI":"10.1142\/s0217595919500015","article-title":"Efficient cluster-based heuristics for the team orienteering problem with time windows","volume":"36","author":"Gavalas","year":"2019","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.7717\/peerj-cs.3350\/ref-12","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-38527-8_34","article-title":"Cluster-based heuristics for the team orienteering problem with time windows","volume-title":"Experimental Algorithms","author":"Gavalas","year":"2013"},{"key":"10.7717\/peerj-cs.3350\/ref-13","article-title":"A fast algorithm for personalized travel planning recommendation","author":"Gunawan","year":"2016"},{"issue":"2","key":"10.7717\/peerj-cs.3350\/ref-14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering problem: a survey of recent variants, solution approaches and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-15","doi-asserted-by":"publisher","first-page":"e1609","DOI":"10.7717\/peerj-cs.1609","article-title":"Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the traveling salesman problem (TSP)","volume":"9","author":"Hao","year":"2023","journal-title":"PeerJ Computer Science"},{"issue":"2","key":"10.7717\/peerj-cs.3350\/ref-16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.22266\/ijies2024.0430.20","article-title":"Generating a multi-day travel itinerary recommendation using the hybrid ant colony system and brainstorm optimization algorithm","volume":"17","author":"Hendrawan","year":"2024","journal-title":"International Journal of Intelligent Engineering and Systems"},{"issue":"9","key":"10.7717\/peerj-cs.3350\/ref-17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.asoc.2018.08.026","article-title":"A multi-objective evolutionary algorithm based on decomposition and constraint programming for the multi-objective team orienteering problem with time windows","volume":"73","author":"Hu","year":"2018","journal-title":"Applied Soft Computing Journal"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.22266\/ijies2025.0430.18","article-title":"Hybrid genetic and simulated annealing algorithm for vehicle routing problem in recommendation of tour route in days","volume":"18","author":"Istiqfarri","year":"2025","journal-title":"International Journal of Intelligent Engineering and Systems"},{"issue":"4","key":"10.7717\/peerj-cs.3350\/ref-19","doi-asserted-by":"publisher","first-page":"110219","DOI":"10.1016\/j.asoc.2023.110219","article-title":"Discrete komodo algorithm for traveling salesman problem","volume":"139","author":"Jati","year":"2023","journal-title":"Applied Soft Computing"},{"issue":"8","key":"10.7717\/peerj-cs.3350\/ref-20","doi-asserted-by":"publisher","first-page":"103557","DOI":"10.1016\/j.im.2021.103557","article-title":"Explore for a day? Generating personalized itineraries that fit spatial heterogeneity of tourist attractions","volume":"58","author":"Ji","year":"2021","journal-title":"Information & Management"},{"issue":"10","key":"10.7717\/peerj-cs.3350\/ref-21","doi-asserted-by":"publisher","first-page":"105794","DOI":"10.1016\/j.cor.2022.105794","article-title":"Time dependent orienteering problem with time windows and service time dependent profits","volume":"143","author":"Khodadadian","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.7717\/peerj-cs.3350\/ref-22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/I2CT57861.2023.10126218","article-title":"Recommender system for tourist routes in yogyakarta using simulated annealing algorithm","author":"Mahardika","year":"2023"},{"key":"10.7717\/peerj-cs.3350\/ref-23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-04148-8_3","article-title":"Algorithm selection for the team orienteering problem","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M\u0131s\u0131r","year":"2022"},{"issue":"11","key":"10.7717\/peerj-cs.3350\/ref-24","doi-asserted-by":"publisher","first-page":"105620","DOI":"10.1016\/j.cor.2021.105620","article-title":"A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)","volume":"138","author":"Moosavi Heris","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"10","key":"10.7717\/peerj-cs.3350\/ref-25","doi-asserted-by":"publisher","first-page":"111351","DOI":"10.1016\/j.asoc.2024.111351","article-title":"Contextual analysis of solutions in a tourist trip design problem: a fuzzy logic-based approach","volume":"154","author":"P\u00e9rez-Ca\u00f1edo","year":"2024","journal-title":"Applied Soft Computing"},{"issue":"2","key":"10.7717\/peerj-cs.3350\/ref-26","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"issue":"1","key":"10.7717\/peerj-cs.3350\/ref-27","doi-asserted-by":"publisher","first-page":"108043","DOI":"10.1016\/j.asoc.2021.108043","article-title":"Komodo mlipir algorithm","volume":"114","author":"Suyanto","year":"2022","journal-title":"Applied Soft Computing"},{"issue":"4","key":"10.7717\/peerj-cs.3350\/ref-28","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s40558-024-00297-w","article-title":"Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques","volume":"26","author":"Sylejmani","year":"2024","journal-title":"Information Technology & Tourism"},{"key":"10.7717\/peerj-cs.3350\/ref-29","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/HIS.2012.6421351","article-title":"A tabu search approach for multi constrained team orienteering problem and its application in touristic trip planning","author":"Sylejmani","year":"2012"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s40558-017-0080-9","article-title":"Planning the trip itinerary for tourist groups","volume":"17","author":"Sylejmani","year":"2017","journal-title":"Information Technology and Tourism"},{"issue":"2","key":"10.7717\/peerj-cs.3350\/ref-31","doi-asserted-by":"publisher","first-page":"115723","DOI":"10.1016\/j.eswa.2021.115723","article-title":"A simulated annealing-based recommender system for solving the tourist trip design problem","volume":"186","author":"Tlili","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"10.7717\/peerj-cs.3350\/ref-32","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"Journal of the Operational Research Society"},{"key":"10.7717\/peerj-cs.3350\/ref-33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-29746-6_3","volume-title":"Definitions and mathematical models of OP variants","author":"Vansteenwegen","year":"2019"},{"issue":"1","key":"10.7717\/peerj-cs.3350\/ref-34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: a survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.7717\/peerj-cs.3350\/ref-35","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"10.7717\/peerj-cs.3350\/ref-36","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10479-017-2409-3","article-title":"The time-dependent orienteering problem with time windows: a fast ant colony system","volume":"254","author":"Verbeeck","year":"2017","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.7717\/peerj-cs.3350\/ref-37","doi-asserted-by":"publisher","first-page":"2203574","DOI":"10.1080\/08839514.2023.2203574","article-title":"Intelligent recommendation model of tourist places based on collaborative filtering and user preferences","volume":"37","author":"Wang","year":"2023","journal-title":"Applied Artificial Intelligence"},{"issue":"5","key":"10.7717\/peerj-cs.3350\/ref-38","doi-asserted-by":"publisher","first-page":"120258\u2013120269","DOI":"10.1109\/access.2023.3327273","article-title":"Deep reinforcement learning-based multi-object adaptive route planning for traveling recommender systems","volume":"11","author":"Wang","year":"2023","journal-title":"IEEE Access"},{"issue":"3","key":"10.7717\/peerj-cs.3350\/ref-39","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.cjpre.2022.09.004","article-title":"Personalized day tour design for urban tourists with consideration to co2 emissions","volume":"20","author":"Wu","year":"2022","journal-title":"Chinese Journal of Population, Resources and Environment"},{"issue":"10","key":"10.7717\/peerj-cs.3350\/ref-40","doi-asserted-by":"publisher","first-page":"106084","DOI":"10.1016\/j.cie.2019.106084","article-title":"Selective discrete particle swarm optimization for the team orienteering problem with time windows and partial scores","volume":"138","author":"Yu","year":"2019","journal-title":"Computers & Industrial Engineering"}],"container-title":["PeerJ Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/peerj.com\/articles\/cs-3350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3350.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3350.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3350.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T08:30:35Z","timestamp":1762936235000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/articles\/cs-3350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,12]]},"references-count":40,"alternative-id":["10.7717\/peerj-cs.3350"],"URL":"https:\/\/doi.org\/10.7717\/peerj-cs.3350","archive":["CLOCKSS","LOCKSS","Portico"],"relation":{},"ISSN":["2376-5992"],"issn-type":[{"value":"2376-5992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,12]]},"article-number":"e3350"}}