A Theoretical Model and Convergence Analysis of Memetic Evolutionary Algorithms

• Published in: Advances in Natural Computation pp. 1035 - 1043
• Main Authors: Xu, Xin, He, Han-gen
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Abstract Model; Applied sciences; Artificial intelligence; Computer science; control theory; systems; Convergence Analysis; Evolution Operator; Exact sciences and technology; Global Search; Local Search; Local search; Gradient; Genetic algorithm; Evolutionary algorithm; Convergence rate; Abstract interpretation; Modeling; Gradient method; Algorithm analysis; Evolution operator; Search algorithm
• ISBN: 9783540283256; 3540283250; 3540283234; 9783540283232
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11539117_142

Memetic evolutionary algorithms (MEAs) combine the global search of evolutionary learning methods and the fine-tune ability of local search methods so that they are orders of magnitude more accurate than traditional evolutionary algorithms in many problem domains. However, little work has been done on the mathematical model and convergence analysis of MEAs. In this paper, a theoretical model as well as the convergence analysis of a class of gradient-based MEAs is presented. The results of this paper are extensions of the research work on the abstract model and convergence analysis of general evolutionary algorithms. By modeling the local search of gradient methods as an abstract strong evolution operator, the theoretical framework for abstract memetic evolutionary algorithms is derived. Moreover, the global convergence theorems and the convergence rate estimations of gradient-based MEAs are also established.