Abstract
In this paper we present parallel genetic algorithm that was used to the task of evolving imperative sort programs. A variety of interesting lessons were learned. With proper selection of the primitives, sorting programs were evolved that are both general and non-trivial. Unique aspect of our approach is that we represent the individual programs with simple assembler code, rather than usual tree like structure. We also report the effect of different parameters on quality of the programs and time needed for finding the solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
De Jong, K.A.: On Using Genetic Algorithms to Search Program Spaces. In: Grefenstette, J. (ed.) Proceedings of the 2nd International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Hillsdale (1987)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, MA (1989)
Koza, J.R.: Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems, Technical Report No. STAN-CS-90-1314, Computer Science Department, Stanford University (1990)
Koza, J.R.: Genetic Programming. MIT Press, Cambridge (1992)
Kinnear, K.E.: Evolving a sort: Lessons in genetic programming. In: Proceedings of the 1993 International Conference on Neural Networks, vol. 2. IEEE Press, San Francisco (1993)
O’Reilly, U.-M., Oppacher, F.: An experimental perspective on genetic programming. In: Parallel Problem Solving from Nature 2 (1992)
O’Reilly, U.-M.: A comparative analysis of Genetic Programming. In: Advances in Genetic Programming 2. MIT Press, Cambridge (1996)
Knuth, D.E.: The art of computer programming, volume 3, sorting and searching. Addison Wesley Longman Publishing Co., Redwood City (1998)
Spector, L., Klein, J., Keijzer, M.: The push3 execution stack and the evolution of control. In: GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation. ACM Press, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trajkovski, I. (2013). Parallel Genetic Algorithm for Creation of Sort Algorithms. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2013. Lecture Notes in Computer Science(), vol 8083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40495-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-40495-5_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40494-8
Online ISBN: 978-3-642-40495-5
eBook Packages: Computer ScienceComputer Science (R0)