EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm

Z K Abdurahman Baizal iD, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan

PeerJ Computer Science · 12.11.2025 · 11 · e3350

DOI: 10.7717/peerj-cs.3350 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 12.11.2025. Verfasst von Z K Abdurahman Baizal und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Computing, Telkom University, Bandung, West Java, Indonesia. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Research and Innovation Agency of the Republic of Indonesia, Research and Innovation for Advanced Indonesia (RIIM) Batch 7 program.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

Stichwörter der Autor:innen

Multi-attribute utility theoryMulti-day routes recommender systemTeam orienteering problem with time windowsWeighted multi-attribute user preference

Autor:innen und Institutionen

  • School of Computing, Telkom University, Bandung, West Java, Indonesia.
  • School of Industrial Engineering, Telkom University, Bandung, West Java, Indonesia.
  • National Research and Innovation Agency, Bandung, Indonesia.
  • Telkom Indonesia, Jakarta, Indonesia.

ORCID-Profile: Z K Abdurahman Baizal

Förderung

  • National Research and Innovation Agency of the Republic of Indonesia
  • Research and Innovation for Advanced Indonesia (RIIM) Batch 7 program

Zitieren

APA

Baizal, Z. K. A., Gumilang, S. F. S., Nurtantyana, R., & Hendrawan, R. (2025). KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm. PeerJ Computer Science, 11, e3350. https://doi.org/10.7717/peerj-cs.3350

Vancouver

Baizal ZKA, Gumilang SFS, Nurtantyana R, Hendrawan R. KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm. PeerJ Computer Science. 2025;11:e3350. doi:10.7717/peerj-cs.3350

BibTeX
@article{Baizal2025,
  author = {Baizal, Z K Abdurahman and Gumilang, Soni Fajar Surya and Nurtantyana, Rio and Hendrawan, Rahmat},
  title = {KomoTrip: a multi-day travel itinerary recommendation method based on the discrete komodo mlipir algorithm},
  journal = {PeerJ Computer Science},
  year = {2025},
  volume = {11},
  pages = {e3350},
  doi = {10.7717/peerj-cs.3350}
}
Kostenlos starten →