摘要
介绍了模拟退火算法的基本思想 ,并应用它成功地解决了通讯网络极小生成树的优化计算问题。计算结果表明 :该算法能有效地跳出局部极小值并快速地收敛于全局最优值。说明模拟退火算法是一个通用的、具有概率爬山的。
The basic thought of Simulated Annealing algorithm is introduced in this paper. This algorithm is successfully used to solve the problem of optimal calculation of the minimum spanning tree of communication network. The computed result indicates that the algorithm can jump out of the local optimization efficiently and constringe the global optimization quickly. So, the Simulated Anneaning algorithm is a general, powerful combinatorial optimization algorithm with the ability to ascend according to the probability.
出处
《成都理工学院学报》
CAS
CSCD
北大核心
2002年第1期90-92,共3页
Journal of Chengdu University of Technology
基金
国土资源部高校年轻教师资助计划项目
