A kind of simulated annealing algorithm with memory solving traveling salesman problem

The simulated annealing algorithm is an effective approach to solve combinatorial optimization problems. This paper presents an improved simulated annealing algorithm with memory. The improved algorithm employed a memory function to remember the current best solution. The improved algorithm also designed an adaptive update function of temperature and increased complementary search process to improve the global searching ability. At last,the algorithm is applied to traveling salesman problem(TSP). The experiment results show that this algorithm is effective and practicable.