An ising machine-based solver for visiting-route recommendation problems in amusement parks

Yosuke MUKASA*, Tomoya WAKAIZUMI, Shu TANAKA, Nozomu TOGAWA

*この研究の対応する著者

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)1592-1600
ページ数9
ジャーナルIEICE Transactions on Information and Systems
E104D
10
DOI
出版ステータスPublished - 2021

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能

フィンガープリント

「An ising machine-based solver for visiting-route recommendation problems in amusement parks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル