Aug 2026· ACM Transactions on Spatial Algorithms and Systems· 0 citations· 13 references
TL;DR
The results of the extensive evaluation demonstrate that DIRECT outperforms baseline methods in generating diverse tourist routes, and dynamically generates a diverse set of high-quality route alternatives, while respecting user-specified spatio-temporal constraints and category preferences.
Abstract
Effective tourist route generation can substantially enhance visitor experiences in urban areas by offering a diverse set of relevant route options while promoting the efficient use of urban infrastructure. However, the generation of tourist routes poses substantial challenges, primarily due to a complex set of often conflicting optimization objectives, and the scarcity of historical user trajectories for training data-driven models. In this article, we propose DIRECT, a geospatially informed novel deep reinforcement learning-based approach for tourist route generation. DIRECT dynamically generates a diverse set of high-quality route alternatives, while respecting user-specified spatio-temporal constraints and category preferences. Crucially, DIRECT does not require any historical user trajectories; instead, it leverages publicly available point-of-interest (POI) data and road network information. The results of our extensive evaluation demonstrate that DIRECT outperforms baseline methods in generating diverse tourist routes.
A straightforward Deep Reinforcement Learning baseline framework that pairs a Double Deep Q-Network (Double DQN) with a deterministic pathfinding module to provide a simulation-based DRL baseline for future comparative studies in intelligent tourism mobility.
Phan Gia Bao Le, S. Moridpour, M. Dinh· International Conference on...· 0 citations
Tour route recommendation aims to generate feasible travel sequences based on user needs and time budgets. Most existing tour route generation models rely heavily on trajectory sequence information and underutilize multimodal data of attractions, leading to limited adaptability to real-world scenarios with missing moda...
Min-Min Zhang· Journal of Computer Science...· 0 citations
A deep architecture that is able to jointly optimize cost functions and route-ranking model towards any route preference is proposed, and a novel loss function is proposed that optimizes a single-objective variable, with other variables strictly under constraints.
Rui-Zhao-Min-,-Ning-Bo-Wen-,-Li-Si-Yao Zhao, Chao Chen, Long-Fei Xu et al.· 0 citations
This study formulates individual route reproduction as a shortest-path problem over learned driver-specific latent link costs. The central idea is that, once such latent costs are inferred from contextual information, observed routes can be reproduced without enumerating alternative route sets. We propose a neural pipe...
Gyeongjun Kim, Yeseul Kang, Keemin Sohn· 0 citations
This work proposes Preference Optimization with Locally Augmented Refinement with Locally Augmented Refinement (POLAR), a novel training algorithm that applies a local search refinement pass to the best decoded tour before forming preference pairs, yielding much more informative pairwise margins.
Arthur Corrêa, P. Nascimento, Samuel Moniz· 0 citations
A practical division of labor is suggested: language modeling handles ambiguous user intent, while an explicit optimizer remains responsible for spatial feasibility and resource limits.
Kai-Nan Ma, Wei Pan· Frontiers in Computing and I...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.