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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Fair and Online Itinerary Recommendation for Multiple Visitors in Crowded Destinations

Sandjai Bhulai, Caroline Jeanne Jagtenberg, Rob van der Mei, Joris Slootweg et al.
ACM Transactions on Recommender Systems
Recommender Systems and Techniques
article

Fair and Online Itinerary Recommendation for Multiple Visitors in Crowded Destinations

Sandjai Bhulai, Caroline Jeanne Jagtenberg, Rob van der Mei, Joris Slootweg, Jesse Nagel
article en

Abstract

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.

ACM Transactions on Recommender Systems
Centrum Wiskunde & Informatica (NL), Vrije Universiteit Brussel (BE), Vrije Universiteit Amsterdam (NL)
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon