arrow
Return

A tree search algorithm towards solving Ising formulated combinatorial optimization problems

delete2022-08-30
delete4
delete
OA
AI
Y
Yunuo Cen
D
Debasis Das
X
Xuanyao Fong *
DOI:10.1038/s41598-022-19102-xdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily recast as the ground state search problem of the Ising Hamiltonian. However, for practical implementation, the annealing process cannot be arbitrarily slow and hence, it may deviate from the expected stationary Boltzmann distribution and become trapped in a local energy minimum. To overcome this problem, this paper proposes a heuristic search algorithm by expanding search space from a Markov chain to a recursive depth limited tree based on SA, where the parent and child nodes represent the current and future spin states. At each iteration, the algorithm selects the best near-optimal solution within the feasible search space by exploring along the tree in the sense of look ahead. Furthermore, motivated by the coherent Ising machine (CIM), the discrete representation of spin states is relaxed to a continuous representation with a regularization term, which enables the use of the reduced dynamics of the oscillators to explore the surrounding neighborhood of the selected tree nodes. We tested our algorithm on a representative NP-hard problem (MAX-CUT) to illustrate the effectiveness of the proposed algorithm compared to semi-definite programming (SDP), SA, and simulated CIM. Our results show that with the primal heuristics SA and CIM, our high-level tree search strategy is able to provide solutions within fewer epochs for Ising formulated combinatorial optimization problems.
Keywords:
OSCILLATORS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Scientific Reports cover
Scientific Reports
IF:
3.9
Papers:
28.3W
Citations:
83.5W

Organization

N
National University of Singapore
Scholars:
7.6W
Papers: 6.5W
Citations: 11.4W
Cited Papers

Cited Papers

errShare
errSave
Intrinsic optimization using stochastic nanomagnets
err2017-03-15
err203
errOAAI
errSutton, Brian; Camsari, Kerem Yunus; Behin-Aein, Behtash; Datta, Supriyo
errShare
errSave
Efficient sampling of ground and low-energy Ising spin configurations with a coherent Ising machine
err2022-01-03
err20
errOAAI
errNg, Edwin; Onodera, Tatsuhiro; Kako, Satoshi; McMahon, Peter L.; Mabuchi, Hideo; Yamamoto, Yoshihisa
errShare
errSave
New hybrid concentrated photovoltaic/membrane distillation unit for simultaneous freshwater and electricity production
err2023-08-01
err0
PREAI
errMohammed Rabie; Abdallah Y.M. Ali; Essam M. Abo-Zahhad; M.F. Elkady; A.H. El-Shazly; Mohamed S. Salem; Ali Radwan; Saeid Rajabzadeh; Hideto Matsuyama; Ho kyong Shon
errShare
errSave
Fractional cascading: I. A data structuring technique
err1986-11-01
err0
PREAI
errBernard Chazelle; Leonidas J. Guibas
errShare
errSave
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
err2014-10-26
err404
PREAI
errMarandi, Alireza; Wang, Zhe; Takata, Kenta; Byer, Robert L.; Yamamoto, Yoshihisa
errShare
errSave
errShare
errSave
researcher View more