Optimization by Move--Class Deflation
Reimer Kuehn, Yu-Cheng Lin, Gerhard Poeppel
Abstract
A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems known to be NP hard, namely the problem of finding ground states of the SK spin--glass and of the 3-D J spin-glass. The algorithm is sensitive to properties of phase spaces of complex systems other than those explored by simulated annealing, and it may therefore also be used as a diagnostic instrument. Moreover, dynamic freezing transitions, which are well known to hamper the performance of simulated annealing in the large system limit are not encountered by the present setup.
Create a lesson
Related papers
Long-time Dynamics of Many-body Open Quantum Systems using Quantum Generating Functions
Katha Ganguly, Dario Poletti, Bijay Kumar Agarwalla
Localization Delocalization Transition in Diffusion with Adaptive Resetting
Tommer D. Keidar, Shlomi Reuveni
Quenched activity induces nonuniversal scaling in nonreciprocal XY Models and surfaces
Sudip Mukherjee, Abhik Basu
Brownian yet non-Gaussian diffusion through equilibrium nonlinear friction
Jakob Mihatsch, Andreas M. Menzel
When dissipative steady states admit thermodynamic occupation laws
Tetsu Ichitsubo
Fluctuation--response relations from an emergent Z2 symmetry in the rotating stochastic Landau model
Dhruv Kush, Nicki Mullins, Mauricio Hippert et al.