Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

An Evolutionary Programming Algorithm for Automatic Engineering Design

Summary: An Evolutionary Programming Algorithm for
Automatic Engineering Design
Andrew Lewis1
, David Abramson2
and Tom Peachey2
Div. of Information Services, Griffith University, Brisbane, Queensland, Australia
Dept. of Computer Science and Software Engineering, Monash University,
Melbourne, Victoria, Australia
a.lewis@griffith.edu.au, davida@csse.monash.edu.au, tcp@csse.monash.edu.au
Abstract. This paper describes a new Evolutionary Programming al-
gorithm 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.
1 Introduction
In the engineering design process there is a demand for the capability to per-
form automatic optimisation, minimising or maximising some derived quantity,


Source: Abramson, David - Caulfield School of Information Technology, Monash University


Collections: Computer Technologies and Information Sciences