Abstract
From 1980s mean field approximation algorithm has been applied by many researchers to solve combinatorial optimization problems. It has been well known that critical phenomenon shows up during the process of annealing in the mean field approximation and critical temperature has also been studied.In this paper, an adaptive annealing method is introduced to the mean field approximation algorithm, where the annealing schedule is changed according to the prediction of critical temperature. This Adaptive mean field approximation algorithm is applied to graph partitioning problem and experimental results show that the computing speed is faster than mean field approximation algorithm with the same solution quality.
