Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!pipex!uknet!dcs.gla.ac.uk!udcf.gla.ac.uk!gapv64
From: gapv64@cent.gla.ac.uk (Brian Ewins)
Subject: Constrained Optimization
Message-ID: <gapv64.781787221@cent.gla.ac.uk>
Sender: news@udcf.glasgow.ac.uk (News)
Organization: Glasgow University Computing Service
Date: Mon, 10 Oct 1994 11:07:01 GMT
Lines: 15

Hi,
	I was wondering if anyone out there uses GA's for
_constrained_ optimisation? I've got a problem that looks
quite simple to solve by GA, except that it seemed to me that
having large numbers of constraints in the fitness function,
as well as the function I really want to optimise would be
_really_ slow. 
	Currently the problem I'm looking at is solved by a
standard augmented Lagrange multiplier method, but I was just
curious if GA's would be any better at finding the global minima.

A few words of wisdom (like 'dont do it') are acceptable, but if
it's been done references would be appreciated.

		Baz.
