Fair and Online Itinerary Recommendation for Multiple Visitors in Crowded Destinations
Coordinating tourist trips in congested destinations allows for higher user satisfaction and reduced waiting times. A new online problem is introduced to allow the recommendation of tourist-trip itineraries when only limited information is available on arriving tourists. We propose a recommender system for generating congestion-aware itineraries in real time for a large number of tourists. The goal of the algorithm is to suggest high quality itinerary recommendations which lead to a fair allocation of tourists to points of interest. We test this method using different underlying heuristics. Numerical experiments show that the proposed algorithm outperforms a First-Come-First-Served policy and performs reasonably close to offline methods. The online algorithm is able to solve realistically sized problem instances with competitive running times. We find that for realistically sized instances, methods based on an iterated local search heuristic result in flatter distributions of score over users than those based on a greedy randomized adaptive search procedure.
Authors
- Sandjai Bhulai (ORCID: https://orcid.org/0000-0003-1124-8821)
- Caroline Jeanne Jagtenberg (ORCID: https://orcid.org/0000-0002-0742-7707)
- Rob van der Mei (ORCID: https://orcid.org/0000-0002-5685-5310)
- Joris Slootweg (ORCID: https://orcid.org/0000-0002-0028-095X)
- Jesse Nagel (ORCID: https://orcid.org/0009-0009-6291-2025)
Institutions
- Centrum Wiskunde & Informatica (NL)
- Vrije Universiteit Brussel (BE)
- Vrije Universiteit Amsterdam (NL)
Publication Details
- Journal
- ACM Transactions on Recommender Systems
- Published
- 2026-11-14
- DOI
- https://doi.org/10.1145/3863937
- Primary Topic
- Recommender Systems and Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00