An Ising Machine-Based Solver for Visiting-Route Recommendation Problems in Amusement Parks

Yosuke MUKASA  Tomoya WAKAIZUMI  Shu TANAKA  Nozomu TOGAWA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E104-D    No.10    pp.1592-1600
Publication Date: 2021/10/01
Publicized: 2021/07/08
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2020EDP7264
Type of Manuscript: PAPER
Category: Computer System
Keyword: 
Ising machine,  amusement park,  combinatorial optimization problem,  Ising model,  quadratic unconstrained binary optimization,  

Full Text: PDF>>
Buy this Article



Summary: 
In an amusement park, an attraction-visiting route considering the waiting time and traveling time improves visitors' satisfaction and experience. We focus on Ising machines to solve the problem, which are recently expected to solve combinatorial optimization problems at high speed by mapping the problems to Ising models or quadratic unconstrained binary optimization (QUBO) models. We propose a mapping of the visiting-route recommendation problem in amusement parks to a QUBO model for solving it using Ising machines. By using an actual Ising machine, we could obtain feasible solutions one order of magnitude faster with almost the same accuracy as the simulated annealing method for the visiting-route recommendation problem.