Solving Traveling Salesman Problems Using Ising Models with Simulated Bifurcation
Abstract: Many combinatorial optimization problems can be solved by numerically simulating classical nonlinear Hamiltonian systems based on the Ising model. Solving the traveling salesman problem (TSP) using the Ising model requires a quadratically increasing number of spins with strict constraints. Unlike classical simulated annealing, simulated bifurcation (SB) can update the states of spins in parallel. This feature can potentially accelerate the convergence of Hamiltonian in the Ising model by taking advantage of modern multi-core processors. As an improved SB algorithm, the ballistic SB (bSB) algorithm is considered for solving the TSP in this paper. The TSP is converted to an Ising problem with external magnetic fields. bSB is then expanded by introducing a time-dependent factor. Experiments on benchmark datasets show that the bSB-based Ising solver offers superior performance in solution quality and convergence speed.
Loading