Abstract
This article describes a new problem solving paradigm: the Symbiotic Algorithm. Problem solutions are considered as embedded organisms whose genetic materials are expressed as evaluable phenotypes. This organic hierarchy can be viewed as a biosphere containing the whole set of creatures manipulated by the algorithm. Being immortal, organisms do not replicate. The only changes occuring in the biosphere are the creation or destruction of symbiotic relationships between organisms. To let these relationships appear and evolve, we provide a fitness function which decides the outcome of organic interplay. The higher an organism's fitness is, the more likely it is to remain unchanged and the more likely it is to invade weaker participants.
Some experiments, addressing the optimization of sinusoidal functions, show that the organic hierarchy adopts configurations in which appear substructures corresponding to optimal solutions. Moreover, the use of multimodal fitness functions induce phenotype distributions matching the fitness function peaks.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lawrence Davis. Genetic Algorithms and Simulated Annealing. Research Notes in Artificial Intelligence. Morgan Kauffmann Publishers, Inc., Los Altos, California, 1987.
David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Mass., 1989.
David E. Goldberg, Kalyanmoy Deb, and Bradley Korb. Don't worry, be messy. In Richard K. Belew and Lashon B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 24–30. University of California, San Diego, Morgan Kaufmann Publishers, 1991.
J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
J.J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci., 79:2554–2558, 1982.
Lynn Margulis. Symbiosis in Cell Evolution (second edition). Freeman, 1993.
W.S. McCulloch and W. Pitts. A logical calculus of the idea immanent in nervous activity. Bulletin of Mathematical Biophysics, 5:115–133, 1943.
Zbigniew Michalewicz. Genetic Algorithms+Data Structures=Evolution Programs. Springer Verlag, 1992.
M. Minsky and S. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, 1969.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dumeur, R. (1996). Evolution through cooperation: The Symbiotic Algorithm. 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_36
Download citation
DOI: https://doi.org/10.1007/3-540-61108-8_36
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