模拟退火算法和遗传算法的比较与思考  

Simulated Annealing and Genetic Algorithms Comparison and Reflection

作　　者：解晨[1] 韦雄奕[1] XIE Chen,WEI Xiong-yi（Zhongshan University Letter Academy,Guangzhon 510275,China）

机构地区：[1]中山大学信科学院,广东广州510275

出　　处：《电脑知识与技术》2013年第7期4418-4419,共2页Computer Knowledge and Technology

摘　　要：在目前的计算机学科中,有一大类问题至今还没有快速合理的解决算法,并且其中有很多问题都是在实际应用中所碰到的优化问题。虽然目前没有能精确解决这些问题的最优算法,但是在实际应用中,人们还是找到了许多能产生近似最优解的有效算法,模拟退火算法和遗传算法便是这一类算法中的经典算法。该文浅析了此两种算法的原理,并通过一个简单的例子对这两种算法进行了比较和总结。In computer science at present,there is a large class of problems are still not solved fast algorithm is reasonable,and there are many problems are optimization problems encountered in practical application.Although there is no optimal algorithm can solve the problem of accurate,but in the actual application,people still find many can produce approximate effective optimal solution algo rithm,simulated annealing algorithm and genetic algorithm is the classic algorithm of this kind of algorithm.This paper analyzes the principleofthetwoalgorithms,and through asimpleexample of the two algorithms were compared and summarized.

关 键 词：组合优化 模拟退火算法 遗传算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]