Trip Planning Based on subQUBO Annealing
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that Gearbox 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 machines solve the combinatorial optimization