Research on the Initial Value of the Simulated Annealing

Abstract

Simulated Annealing Algorithm is one of the top ten classical optimization algorithm, and it has been successfully applied to various fields. Simulated annealing is a optimization algorithm which can find the global optimal solution, compares to neural network algorithm, it is so easily to implement that has higher probability to be adopted, but it has own shortcomings like other optimization algorithms, its result largely depends on initial value, The initial value of the traditional simulated annealing algorithm began with a random number, its convergence speed is often slow very much and the effect is bad. In this paper, a new simulated annealing algorithm that based on genetic algorithm and hill-climbing method was brought up, because of hill-climbing algorithm was easy to fall into local optimum, and simulated annealing can just solve the problem, it not only escaped from local optimum, but also got good convergence speed and results.