An annealing framework with learning memory

Simulated annealing can be viewed as a process that generates a sequence of Markov chains, i.e., it keeps no memory about the states visited in the past of the process. This property makes simulated annealing time-consuming in exploring needless states and difficult in controlling the temperature and transition number. In this paper, we propose a new annealing model with memory that records important information about the states visited in the past. After mapping applications onto a physical system containing particles with discrete states, the new annealing method systematically explores the configuration space, learns the energy information of it, and converges to a well-optimized state. Such energy information is encoded in a learning scheme. The scheme generates states distributed in Boltzmann-style probability according to the energy information recorded in it. Moreover, with the assistance of the learning scheme, controlling over the annealing process become simple and deterministic. From qualitative and quantitative analyses in this paper, we can see that this convenient framework provides an efficient technique for combinatorial optimization problems and good confidence in the solution quality