Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Nagel et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: