J4 ›› 2011, Vol. 33 ›› Issue (12): 84-86.
• 论文 • 上一篇 下一篇
季艳芳,曹〓炬
收稿日期:
修回日期:
出版日期:
发布日期:
JI Yanfang,CAO Ju
Received:
Revised:
Online:
Published:
摘要:
本文通过对新提出的求解全局优化问题的云搜索算法[1]进行分析,可以看出算法的整个搜索过程包含飘移算子、降雨生云算子、收缩扩张算子。倘若收缩扩张算子失效,那么算法将在比较坏的情形下进行搜索。在此情形下,我们利用概率论的知识分析了算法的收敛性。分析结果表明,云搜索算法依概率1收敛到全局最优解。
关键词: 云搜索算法, 收敛性, 收敛概率
Abstract:
We analyse the global optimization problems of the cloud search algorithm, and the algorithm can be seen throughout the search process which includes drift operator, rain clouds of the Health operator, contraction expansion operator. If the contraction of the expansion operator fails, then the algorithm will compare the case of a bad search. In this case, we use the knowledge of probability theory analysis of the convergence of the algorithm. The results indicates that the search algorithm converges to the probability of a global optimal solution.
Key words: cloud search algorithm;convergence;convergence probability
季艳芳,曹〓炬. 云搜索算法的收敛性分析[J]. J4, 2011, 33(12): 84-86.
JI Yanfang,CAO Ju. Convergence Analysis of Cloud Search Algorithms[J]. J4, 2011, 33(12): 84-86.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2011/V33/I12/84