Theoretic Analysis of Multi-modal Immune Algorithm

Author

Yang, Kongyu ; Gao, Binbin ; Liang, Yan

Author_Institution

Beijing Inf. Sci. & Technol. Univ., Beijing

Volume

1

fYear

2008

fDate

18-20 Oct. 2008

Firstpage

384

Lastpage

387

Abstract

The complete convergence problem of multi-modal immune algorithms (MIA) is theoretically proposed, and the implementation forms of typical immune operators in MIA are designed. Using the Markov chain theories, the complete convergence conclusion of MIA is proved via formalized definition, mechanism analysis and mathematical reasoning, the stability, convergent speed and computational complexity of the algorithm are analyzed too, so the theory foundation of MIA is formed basically.

Keywords

Markov processes; computational complexity; convergence; evolutionary computation; mathematical operators; optimisation; Markov chain theory; computational complexity; convergence problem; evolutionary mechanism; mathematical reasoning; multimodal immune algorithm; Algorithm design and analysis; Computational complexity; Convergence; Genetic algorithms; Genetic mutations; Information analysis; Information science; Random number generation; Stability analysis; Stochastic processes; Evolutionary computation; complete convergence; computational complexity; multi-mod immune algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2008. ICNC '08. Fourth International Conference on

Conference_Location

Jinan

Print_ISBN

978-0-7695-3304-9

Type

conf

DOI

10.1109/ICNC.2008.530

Filename

4666874