An Evolutionary Programming Algorithm for Automatic Engineering Design

Lewis, A; Abramson, D; Peachey, T

doi:10.1007/b97218

View/Open

33336_1.pdf (306.2Kb)

Author(s)

Lewis, A

Abramson, D

Peachey, T

Griffith University Author(s)

Lewis, Andrew J.

Year published

2004

Metadata

Show full item record

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.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.
View less >

Journal Title

Lecture Notes in Computer Science

Volume

3019

DOI

https://doi.org/10.1007/b97218

Copyright Statement

© 2004 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com

Publication URI

http://hdl.handle.net/10072/29101

Collection

Journal articles