Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!newsgate.duke.edu!news.mathworks.com!newsfeed.internetmci.com!torn!watserv3.uwaterloo.ca!novice.uwaterloo.ca!real.uwaterloo.ca!aaron
From: aaron@real.uwaterloo.ca (Aaron Baumal)
Subject: Equality Constraints, and Memory 
Sender: news@novice.uwaterloo.ca (Mr. News)
Message-ID: <Du163r.n69@novice.uwaterloo.ca>
Date: Thu, 4 Jul 1996 18:02:15 GMT
Nntp-Posting-Host: real.uwaterloo.ca
Organization: University of Waterloo
Lines: 24

Hi everybody, I am new to this group, but I have been using
Genetic Algorithms for a year now, with applications to
mechanical systems design.  I have been quite successful at
finding good designs with GA's (in terms of objective/fitness),
but fitness is quite expensive to calculate (usually involves
solving a system of ODE's or DAE's and/or non-linear equations).
I have implemented a memory management technique from generation
to generation of the GA, and I have been able to reduce run
time quite significantly (i.e. # of function of evaluations
have been reduced).  Has anybody used such a memory management
technique???

Also, I have had problems using GA's for problems with non-linear
equality constraints.  If anyone has suggestions or references
to give about this, please do so.

Aaron

-- 
Aaron Baumal
MASc Student Systems Design Engineering
University of Waterloo
aaron@real.uwaterloo.ca
http://real.uwaterloo.ca/~morg
