Trip Planning Based on subQUBO Annealing

Trip Planning Based on subQUBO Annealing

The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels. Meanwhile, Ising machines have attracted attention due to their efficiency in solving combinatorial optimization problems. The Ising m...

Full description

Bibliographic Details
Main Authors: Tatsuya Noguchi, Keisuke Fukada, Siya Bao, Nozomu Togawa
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Trip planning problem
Ising machine
quantum computer
Ising model
QUBO model
subQUBO
Online Access:https://ieeexplore.ieee.org/document/10247510/

Similar Items

Similar Items