Study on the application of improved simulated annealing algorithm for several types of optimization problems

An improved annealing simulation method is discussed with the focus on the optimization design problems with continuous variables, discrete variables, hybrid discrete variables and Large-scale TSP. This method not only has memory function and complementary search process but also applies an innovative neighborhood structure to improve the searching ability. Besides, it provides the solution to discretize the discrete variable by average method. The program compiled in VC++ environment achieves the technology to display the computational progress on real-time. Therefore, it is highly intuitive. The results of some practical computational examples show that the improved simulated annealing method is quite efficient and reliable in solving this several kinds of problems, and also it has quite good practicability.