| 模拟退火自适应大变异遗传算法及其应用 |
| |
| 引用本文： | 邢桂华,朱庆保. 模拟退火自适应大变异遗传算法及其应用[J]. 计算机工程, 2005, 31(3): 170-172 |
| |
| 作者姓名： | 邢桂华 朱庆保 |
| |
| 作者单位： | 南京师范大学数学与计算机学院,南京,210097;南京师范大学数学与计算机学院,南京,210097 |
| |
| 基金项目： | 江苏省教育厅自然科学基金资助项目(01KJB520007) |
| |
| 摘 要： | 为了克服遗传算法易陷入局部最优或早熟问题，提出了一种模拟退火大变异遗传算法，采用了大比例优秀个体保护策略，以保证算法的收敛性。应用该算法求解旅行商问题的仿真实验证明了它能较快地收敛到最优解或准最优解。
|
| 关 键 词： | 大变异 遗传算法 TSP问题 模拟退火算法 |
| 文章编号： | 1000-3428(2005)03-0170-03 |
Genetic Algorithm Based on Adaptive Big Mutation Rate and Simulated Annealing and Its Application |
| |
| XING Guihua,ZHU Qingbao. Genetic Algorithm Based on Adaptive Big Mutation Rate and Simulated Annealing and Its Application[J]. Computer Engineering, 2005, 31(3): 170-172 |
| |
| Authors: | XING Guihua ZHU Qingbao |
| |
| 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. |
| |
| Keywords: | Big mutation rate Genetic algorithm Traveling salesman problem Simulated annealing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
