Convergence proof for generic clonal selection algorithm
一般克隆选择算法的收敛性证明*

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.