Skip to content
naulon
Not checkedNot checked for notices yet.

A New Clonal Selection Immune Algorithm with Perturbation Guiding Search and Nonuniform Hypermutation

Xinchao Zhao, Guoshuai Zhao, Shaozhang Niu and 3 more

International Journal of Computational Intelligence Systems · 2010

doi:10.2991/ijcis.2010.3.s1.1 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

A new clonal selection immune algorithm with perturbation guiding search and non-uniform hypermutation (nCSIA) is proposed based on the idea of perturbed particle swarm algorithm and non-uniform mutation. The proposed algorithm proportional clones antibody based on the affinity, adaptively adjusts the searching steps of antibodies with hypermutation according to the adaptive variation rule of non-uniform mutation and chooses the promising antibody based on the affinity by clonal selection principle. In order to keep the balance of exploration/exploitation better, perturbation guiding search strategy is presented, which is actually an elitist learning mechanism and is borrowed from the perturbed particle swarm algorithm. In order to validate the effectiveness of nCSIA, comprehensive experiments and analysis are done based on fifteen unimodal or multimodal benchmark functions. Compared with standard and the recent algorithms, it indicates that the proposed algorithm is feasible, effective and has better performance in terms of convergence, accuracy and stability. More evident predominance emerges from further experimental comparisons with expanding search space and increasing dimensions.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.