Abstract
This paper describes a new Evolutionary Programming algorithm based on Self-Organised Criticality. When tested on a range of problems drawn from real-world applications in science and engineering, it performed better than a variety of gradient descent, direct search and genetic algorithms. It proved capable of delivering high quality results faster, and is simple, robust and highly parallel. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Lewis, A., Abramson, D., & Peachey, T. (2004). An evolutionary programming algorithm for automatic engineering design. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 586–594. https://doi.org/10.1007/978-3-540-24669-5_77
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
