Trip Planning Based on subQUBO Annealing

• Published in: IEEE access Vol. 11; pp. 100383 - 100395
• Main Authors: Noguchi, Tatsuya, Fukada, Keisuke, Bao, Siya, Togawa, Nozomu
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Annealing; Combinatorial analysis; Combinatorial testing; Computational modeling; Costs; Input variables; Ising machine; Ising model; Navigation; Optical computing; Optimization; Planning; Quadratic programming; quantum computer; QUBO model; Search problems; subQUBO; Trip planning problem
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2023.3314498

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 machines solve the combinatorial optimization problems by transforming the problems into quadratic unconstrained binary optimization (QUBO) models. However, the possible input QUBO size of current Ising machines is quite limited. Thus, it is hard to directly embed a large-scale TPP onto the current Ising machines. In this paper, we propose a novel subQUBO annealing method based on the combined variable selection method to solve the TPP. The proposed method finds a quasi-optimal solution to a large problem by repeatedly partitioning the original QUBO model into small subQUBOs that can be embedded onto the Ising machine. Specifically, to construct a subQUBO, we select variables from the original QUBO model, which have small deviation values. Further, we select variables randomly from the original QUBO model, so as not to fall into the local optimum. We have conducted an evaluation experiment using Ising machines on TPP and confirmed that the proposed method outperforms the state-of-the-art methods in terms of POI satisfaction and POI cost.