Abstract

A new strategy for finding optimal solutions to complex problems with many competing requirements is proposed. It consists in an alternating optimization of the energy, cost, or fitness function of the system itself, and of subsystems of all sizes with an appropriate weight function. For various spin glasses (the $N\ensuremath{-}k$ model, the low autocorrelation binary sequence model, and the Coulomb glass), and for traveling salesman problems, the corresponding Monte Carlo algorithm is shown to yield results superior to those obtained by previous optimization techniques.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call