Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!nntp.sei.cmu.edu!news.psc.edu!hudson.lm.com!godot.cc.duq.edu!news.duke.edu!news.mathworks.com!news.kei.com!bloom-beacon.mit.edu!spool.mu.edu!umn.edu!news
From: "James Albert Larson" <larso171@maroon.tc.umn.edu>
Subject: Re: Handling Constraints in GAs
To: monga@aragorn.mece.ualberta.ca
Message-ID: <93765.larso171@maroon.tc.umn.edu>
X-Minuet-Version: Minuet1.0_Beta_16
Sender: news@news.cis.umn.edu (Usenet News Administration)
Nntp-Posting-Host: dialup-4-67.gw.umn.edu
X-Popmail-Charset: English
Organization: University of Minnesota, Twin Cities
Date: Sun, 27 Aug 1995 05:31:20 GMT
Lines: 11

Amit,

>Can someone advise me on how to handle both linear and non linear
>constraints while modeling a classic optimization problem in GAs.

Have you looked at Michalewicz's "Genetic Algorithms + Data Structures = 
Evolution Programs", particularly his Genocop program (described in the 
book and available at his ftp site)?  It fits your problem exactly.

Jim Larson

