This paper presents a comparative study of two important Clonal Selection Algorithms (CSAs): CLONALG and opt-IA. To deeply understand the performance of both algorithms, we deal with four different classes of problems: toy problems (one-counting and trap functions), pattern recognition, numerical optimization problems and NP-complete problem (the 2D HP model for protein structure prediction problem). Two possible versions of CLONALG have been implemented and tested. The experimental results show a global better performance of opt-IA with respect to CLONALG. Considering the results obtained, we can claim that CSAs represent a new class of Evolutionary Algorithms for effectively performing searching, learning and optimization tasks.
|Titolo:||Clonal Selection Algorithms: A Comparative Case Study using Effective Mutation Potentials|
|Data di pubblicazione:||2005|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|