Abstract
During the last years, heterogeneous computing became more and more popular. Its advantage is availability, since any network of workstations can be used as a parallel virtual machine. On the other hand, programming these machines efficiently is even more difficult than programming a parallel dedicated machine. Each machine in the network may dynamically change performance, so optimal load balancing is the main challenge. One also has to deal with reliability problems on the network. With these two points in mind, we designed a parallel genetic algorithm featuring a new reproduction operator, called parallel steady-state reproduction. This operator adapts to a heterogeneous and unpredictable environment by allowing some “chaotic” behaviour. This parallel genetic algorithm revealed to be robust and efficient, and is particularly easy to implement.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Carriero & D. Gelernter, 1989. How to Write Parallel Programs: a Guide to the Perplexed. ACM Computing Surveys, Vol. 21, No. 3.
Ch. Darwin, 1859. The Origin of Species by Means of Natural Selection. Penguin Classics, London.
K. A. de Jong, 1975, Analysis of the Behaviour of a Class of Genetic Adaptive Systems. Ph.D. dissertation, University of Michigan.
D. E. Goldberg, 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.
M. Georges-Schleuter, 1992. ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. Proc. 3rd ICGA. Morgan Kaufman Publishers, pp. 422–427.
M. Krüger, 1993. Using Genetic Algorithms to improve Stochastic Optimization Methods. Eighth Int. Symposium on Computer and Information Sciences, pp. 237–244, Istanbul, Turkey.
E. Lutton, 1994. Etat de l'art des Algorithmes Génétiques. Rapport d'Expertise SGDN, INRIA-Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex, France.
H. Mühlenbein, M. Schomisch & J. Born, 1991. The Parallel Genetic Algorithm as Function Optimizer. Parallel Computing 17, pp. 619–632. North-Holland.
C. B. Petty, M. R. Leuze & J. J. Grefenstette, 1987. A Parallel Genetic Algorithm. Proc. 2nd ICGA. Lawrence Erlbaum Associates, pp. 155–161.
P. Spiessens & B. Manderick, 1991. A Massively Parallel Genetic Algorithm — Implementation and First Analysis. Proc. 4th ICGA. Morgan Kaufmann Publishers, pp. 279–286.
G. Syswerda, 1991. A Study of Reproduction in Generational and Steady-State Genetic Algorithms. Foundations of Genetic Algorithms, Morgan Kaufmann Publishers, pp. 94–101.
E-G Talbi, P. Bessière, 1991. A Paralleled Genetic Algorithm for the graph partitioning problem, ACM Int. Conf on Supercomputing, Cologne, Germany.
H. Tamaki & Y. Nishikawa, 1992. A Paralleled Genetic Algorithm based on a Neighbourhood-Model and its Application to the Job-Shop Scheduling. Parallel Problem Solving from Nature, 2. North-Holland, pp. 573–582.
D. Whitley, 1989. The Genitor Algorithm and Selective Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. Proc. 3rd ICGA. Morgan Kaufmann Publishers, pp. 116–121.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godart, C., Krüger, M. (1996). A genetic algorithm with parallel steady-state reproduction. In: Alliot, JM., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1995. Lecture Notes in Computer Science, vol 1063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61108-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-61108-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61108-0
Online ISBN: 978-3-540-49948-0
eBook Packages: Springer Book Archive