| 一种新的全局优化搜索算法--人口迁移算法(Ⅱ) |
| |
| 引用本文： | 周永华,毛宗源.一种新的全局优化搜索算法--人口迁移算法(Ⅱ)[J].华南理工大学学报(自然科学版),2003,31(4):41-43,55. |
| |
| 作者姓名： | 周永华 毛宗源 |
| |
| 作者单位： | 华南理工大学,自动化科学与工程学院,广东,广州,510640 |
| |
| 基金项目： | 国家自然科学基金资助项目(50177009) |
| |
| 摘 要： | 用概率论分析了新提出的求解函数全局优化问题的人口迁移算法的收敛性及动态特性。分析结果表明人口迁移算法依概率收敛到全局最优解。以找到问题全局最优解的概率为准则，给出了该算法工作在最坏情形时按迭代次数衡量的收敛速度估计，进而给出了该算法按给定概率收敛时的计算时间复杂性估计，即函数计算次数估计。
|
| 关 键 词： | 人口迁移算法 收敛性 收敛概率 收敛速度 计算时间复杂性 |
| 文章编号： | 1000-565X(2003)04-0041-04 |
A New Search Algorithm for Global Optimization:Population Migration Algorithm(Ⅱ) |
| |
| Zhou Yong-hua Mao Zong-yuan.A New Search Algorithm for Global Optimization:Population Migration Algorithm(Ⅱ)[J].Journal of South China University of Technology(Natural Science Edition),2003,31(4):41-43,55. |
| |
| Authors: | Zhou Yong-hua Mao Zong-yuan |
| |
| Abstract: | The convergence property and dynamic characteristics of the newly proposed population migration algorithm for solving global function optimization problems are analyzed by means of probability. It is proved that the algorithm converges to the global optimum in probability. With the probability of finding the global optimum as a criterion, the estimation of convergent speed in terms of iteration numbers of the algorithm running in the worst case is given. And also given is the estimation of computational time complexity in terms of function evaluation numbers of the algorithm converging to the global optimum in given probability. |
| |
| Keywords: | population migration algorithm convergence property convergent probability convergent speed computational time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
