首页 | 本学科首页   官方微博 | 高级检索  
     检索      

模拟退火算法的改进及其应用
引用本文:王强.模拟退火算法的改进及其应用[J].应用数学,1993,6(4):392-397.
作者姓名:王强
作者单位:武汉大学计算机科学系 430072
摘    要:模拟退火算法是随机优化近似算法。本文首先介绍其物理背景和一般形式,然后通过对算法增加记忆和返回两个功能以及在算法之后链接一个局部搜索过程,改善了算法性能,接着将改进算法应用于解旅游商问题,最后对该算法作简要的性能评论。

关 键 词:组合规划  动态规划  模拟退火算法

The Improved Simulated Annealing Algorithm and Its Application
Wang Qiang.The Improved Simulated Annealing Algorithm and Its Application[J].Mathematica Applicata,1993,6(4):392-397.
Authors:Wang Qiang
Abstract:The simulated annealing algorithm is an approximate stochastic optimum algorithm which is widely used in combinational minimum problems. In this paper,the physical background and general style of the algorithm is first introduced. The algorithm is improved by adding record and return functions and jointing a local searching procedure in the end. The improved algorithm is used to solve the traveling salesman problem,the properties of which are briefly analysed.
Keywords:Simulated annealing algorithm  Radom variable  Radom function  Traveling salesman problem  Dynamic programming solution  Space complexity  Time complexity  Combinatorial minimum problem
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号