%0 Journal Article
%T Convergence proof for generic clonal selection algorithm<br>一般克隆选择算法的收敛性证明*
%A FANG Xian-jin
%A LI Long-shu
%A <br>方贤进
%A 李龙澍
%J 计算机应用研究
%D 2010
%I 
%X Clonal selection algorithms have been applied widely in intelligent computation field, but theoretical analysis and research works regarding clonal selection algorithm were lacking relatively. In order to enrich the theoretical underpinning of clonal selection algorithms, this paper investigated the convergence of generic clonal selection algorithms in a similar manner as performed previously for genetic algorithms. The sufficient conditions that generic clonal selection algorithms converge to global optimum for solving optimization problem were derived. Consequently, all kinds of applications based on clonal selection algorithm such as BCA and CLONALG algorithms, their convergence can be proved by examining whether the sufficient conditions are satisfied or not.
%K 克隆选择算法
%K 收敛性
%K 遗传算法
%K 超变异算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=FC32D3A10EA0C8339501A4BAC72DDA63&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=E652F68A3FDC0E89&eid=380BA99738E9DB23&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=12