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

模拟退火算法在连续变量全局优化问题中应用
引用本文:江加和,宋子善,沈为群,邱力为.模拟退火算法在连续变量全局优化问题中应用[J].北京航空航天大学学报,2001,27(5):556-559.
作者姓名:江加和  宋子善  沈为群  邱力为
作者单位:北京航空航天大学 自动控制系
摘    要:研究了基于模拟退火算法应用于连续变量全局优化问题,并给出了实现步骤.介绍了控制参数实用选择方法.针对连续变量的特殊性,给出了新解产生的实用方法.最后以计算机视觉领域中的基本矩阵的求解作为一个实例,来说明它在连续变量中的应用.大量数字仿真结果表明该算法能有效地解决连续变量全局优化问题.

关 键 词:退火  最优化算法  随机搜索  基本矩阵
文章编号:1001-5965(2001)05-0556-04
收稿时间:2000-03-14
修稿时间:2000年3月14日

Application of Simulated Annealing to Global Optimization Problems with Continuous Variables
JIANG Jia-he,SONG Zi-shan,SHEN Wei-qun,QIU Li-wei.Application of Simulated Annealing to Global Optimization Problems with Continuous Variables[J].Journal of Beijing University of Aeronautics and Astronautics,2001,27(5):556-559.
Authors:JIANG Jia-he  SONG Zi-shan  SHEN Wei-qun  QIU Li-wei
Institution:Beijing University of Aeronautics and Astronautics, Dept. of Automatic Control
Abstract:Global optimization problems with continuous variables were discussed based on simulated annealing. Implementation steps were given. Practical methods of determining control parameters were introduced. According to characteristics of continuous variables, practical methods of generating new points from a current point were given. Finally, an example of computing the fundamental matrix in computer vision domain was given to demonstrate the application to continuous variables. The simulation results showed that the algorithm can efficiently solve the global optimization problems with continuous variables.
Keywords:annealing  optimization algorithms  random search  fundamental matrix
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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