Research on Cooling Schedule Selecting Method in Simulated Annealing Algorithm
Jingmei Li · Jisuanji gongcheng · 2000
Cooling schedule is the key to simulated annealing algorithm that is effective means to solvs combination optimal problem. In this paper. some selecting criteria are given about cooling schedule including initial temperature. temperature dropping strategy. Markov chain length and stopping criterion, especiallv about stopping criterion of simulated annealing algorithm. a new criterion is presented similar to the one in tabu search. The above conclusions are successfully applied in the traveling salesman problem of 31 cities in China and in the dithering pattern problem.