Abstract
Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is the long computational time of the numerical annealings. The other one is the determination of the appropriate temperature schedule in SA. The proposed method is based on the concept of the Equilibrium Binary Search which is proposed by Jonathan, and controls the temperature schedule adaptively. In addition, It can reduce the computational time of the numerical annealings maintaining high searching ability. The proposed method is applied to solve many TSPs (Traveling Salesman Problems), and it is found that the method is very useful and effective.
