Enriching Experiences Through Shared Moments: Travel Recommendation for Heterogeneous Users Using Ising Machines

The heterogeneous users travel planning problem (HUTPP) is an optimization problem and it seeks to identify the routes maximizing shared experiences while managing the conflicts over points of interest (POIs) between different users. Conventional methods and solvers using von Neumann computers offer good approximate solutions to optimization problems, but the solution quality may not be guaranteed with limited time costs. On the other hand, Ising machines or quantum annealing machines are non-von Neumann computers that are effective in solving complicated optimization problems. In this paper, we propose an Ising-based method to effectively solve the HUTPP and evaluate the proposed method on a real-world area, Sapporo, Japan. According to the comparison with a conventional method and a conventional solver, the empirical results suggest that the proposed methods outperform the conventional method and solver regarding solution quality, especially with a > 14 % improvement in POI sharing degree.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174883
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enriching Experiences Through Shared Moments: Travel Recommendation for Heterogeneous Users Using Ising Machines

Siya Bao, Nozomu Togawa
Transportation and Mobility Innovations
article

Enriching Experiences Through Shared Moments: Travel Recommendation for Heterogeneous Users Using Ising Machines

Siya Bao, Nozomu Togawa
article en

Abstract

The heterogeneous users travel planning problem (HUTPP) is an optimization problem and it seeks to identify the routes maximizing shared experiences while managing the conflicts over points of interest (POIs) between different users. Conventional methods and solvers using von Neumann computers offer good approximate solutions to optimization problems, but the solution quality may not be guaranteed with limited time costs. On the other hand, Ising machines or quantum annealing machines are non-von Neumann computers that are effective in solving complicated optimization problems. In this paper, we propose an Ising-based method to effectively solve the HUTPP and evaluate the proposed method on a real-world area, Sapporo, Japan. According to the comparison with a conventional method and a conventional solver, the empirical results suggest that the proposed methods outperform the conventional method and solver regarding solution quality, especially with a > 14 % improvement in POI sharing degree.

Waseda University (JP)
Openalex Percentile: Top 71%
Transportation and Mobility Innovations
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.

Enriching Experiences Through Shared Moments: Travel Recommendation for Heterogeneous Users Using Ising Machines — Siya Bao, Nozomu Togawa · (2025) | TGRS Research Map | TGRS