摘要： 为了克服遗传算法易陷入局部最优或早熟问题,提出了一种模拟退火大变异遗传算法,采用了大比例优秀个体保护策略,以保证算法的收敛性。应用该算法求解旅行商问题的仿真实验证明了它能较快地收敛到最优解或准最优解。

关键词: 大变异, 遗传算法, TSP问题, 模拟退火算法

Abstract: To overcome premature or local-best solution , an adaptive big mutation rate algorithm based on simulated annealing, which copies big proportion of the fittest and also melts the theory of simulated annealing algorithm to assure its astringency, is put forward . The simulation to traveling salesman problem proves that the algorithm can rapidly get the best or second best solution.

中图分类号: 

• TP18