Abstract
In this paper we present a framework for modelling Simple and Parallel Evolutionary Algorithm implementations as Co-operating Populations. Using this framework, a method called Co-operating Populations with Different Evolution Behaviours (CoPDEB), for generalizing and improving the performance of Parallel Evolutionary Algorithms (PEAs) is also presented. The main idea of CoPDEB is to maintain a number of populations exhibiting different evolution behaviours. CoPDEB was tested on three problems (the optimization of a real function, the TSP problem and the problem of training a Recurrent Artificial Neural Network), and appears to significantly increase the problemsolving capabilities over PEAs with the same evolution behaviour on each population. This paper also studies the effect of the migration rate (Epoch) and the population size on the performance of both PEAs and CoPDEB.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Adamidis and V. Petridis, On the Parallelization of Artificial Neural Networks and Genetic Algorithms, .Intern. J. Computer Math. 67 (1998), 105–125.
E. Alba, J. M. Troya, A Survey of Parallel Distributed Genetic Algorithms, Complexity 4(4) (1999), 31–52.
T. Blickle and L. Thiele, A comparison of selection schemes used in evolutionary algorithms, Evolutionary Computation (Winter 96), 4 (4) (1996), 361–394
E. Cantú-Paz, A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis 10, No. 2 (1998) pp. 141–171
U. K. Chakraborty, K. Deb, and M. Chakraborty, Analysis of selection algorithms: A Markov chain approach, Evolutionary Computation 4 (2) (Summer 1996), 133–167
D. E. Goldberg, H. Kargupta, J. Horn, and E. Cantu-Paz, “Critical Deme Size for Serial and Parallel Genetic Algorithms”, IlliGAL Report No. 95002, Illinois Genetic Algorithms Lab., Univ of Illinois at Urbana-Champaign, 1995
V. Petridis and S. Kazarlis, Varying quality function in genetic algorithms and the cutting problem, in “Proc First IEEE CEC”, vol I, pp. 166–169, IEEE, 1994
V. Petridis and A. Papaikonomou, Recurrent Neural Networks as Pattern Generators, in “Proc IEEE International Conference on Neural Networks”, pp. 872–875, 1994
M. Srinivas and L. M. Patnaik, Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Transactions on Systems, Man and Cybernetics, 24 (4).
Törn, A., & Zilinskas, A. (1989). Global Optimization. Lecture Notes in Computer Science, vol 350, Berlin: Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adamidis, P., Petridis, V. (2002). On Modelling Evolutionary Algorithm Implementations through Co-operating Populations. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_31
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive