An Immunological Algorithm for Global Numerical Optimization

Numerical optimization of given objective functions is a crucial task in many real-life problems. The present article introduces an immunological algorithm for continuous global optimization problems, called OPT-IA. Several biologically inspired algorithms have been designed during the last few years and have shown to have very good performance on standard test bed for numerical optimization. In this paper we assess and evaluate the performance of OPT-IA, FEP, IFEP, DIRECT, CEP, PSO, and EO with respect to their general applicability as numerical optimization algorithms. The experimental protocol has been performed on a suite of 23 widely used benchmarks problems. The experimental results show that OPT-IA is a suitable numerical optimization technique that, in terms of accuracy, generally outperforms the other algorithms analyzed in this comparative study. The OPT-IA is also shown to be able to solve large-scale problems.

[1]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[2]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[3]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[4]  Jonathan Timmis,et al.  Artificial immune systems - a new computational intelligence paradigm , 2002 .

[5]  Peter J. Bentley,et al.  Artificial immune systems : Third International Conference, ICARIS 2004, Catania, Sicily, Italy, September 13-16, 2004 : proceedings , 2004 .

[6]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[7]  Vincenzo Cutello,et al.  An immune algorithm with hyper-macromutations for the Dill's 2D hydrophobic-hydrophilic model , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[8]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[9]  Vincenzo Cutello,et al.  A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem , 2003, GECCO.

[10]  D. Finkel,et al.  Direct optimization algorithm user guide , 2003 .

[11]  Jonathan Timmis,et al.  Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation , 2003, GECCO.

[12]  L.N. de Castro,et al.  An artificial immune network for multimodal function optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  Vincenzo Cutello,et al.  Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem , 2005, EvoCOP.

[14]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[15]  C. D. Perttunen,et al.  Lipschitzian optimization without the Lipschitz constant , 1993 .

[16]  Vincenzo Cutello,et al.  The Clonal Selection Principle for In Silico and In Vitro Computing , 2005 .

[17]  Vincenzo Cutello,et al.  Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators , 2004, ICARIS.