【摘要】 传统的遗传算法有2个严重的缺点,即不能有效地消除过早收敛现象以及在进化后期搜索效率较低。模拟退火算法是基于金属退火的机理而建立起来的1种全局最优化方法,它能够以随机搜索技术从概率的意义上找到目标函数的全局最小点。将遗传算法与模拟退火算法相结合,提出模拟退火遗传算法。实验结果表明,该算法在性能上有较大的改善。更多还原

【Abstract】 Traditional Genetic algorithm has two serious shortcomings , namely can’t overcame and restrained the phenomenon for a long time effectively , and is evolving on later stage and searching for efficiency relatively low . Simulation anneal algorithm to set up a kind of the overall situation that stand up optimize the method most on the basis of mechanism that the metal anneals, It can be in order to search for small spot the most of the overall situation that technology finds the function of targets from meaning of probability at random. This text anneal genetic algorithm and simulation algorithm combine together, propose the simulated annealing genetic algorithm. The experimental result shows, there is greater improvement on performance in this algorithm.更多还原