Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel-eecis!news.mathworks.com!newsfeed.internetmci.com!hunter.premier.net!netnews.worldnet.att.net!ix.netcom.com!netcom.net.uk!dispatch.news.demon.net!demon!usenet2.news.uk.psi.net!uknet!usenet1.news.uk.psi.net!uknet!uknet!strath-cs!info!news
From: D.Savic@exeter.ac.uk (Dragan Savic)
Subject: GA and large search spaces
Message-ID: <Dto3GL.F9K@exeter.ac.uk>
Sender: news@exeter.ac.uk (news admin)
Organization: Exeter University
X-Newsreader: WinVN 0.93.14
Mime-Version: 1.0
Date: Thu, 27 Jun 1996 16:36:21 GMT
Lines: 9

I am working on a problem which, if represented using binary coding, will 
result in strings of 500 up to 1000 bits. One possible option is to use 
Messy GAs. Does anyone out there has any useful ideas or knows about 
similar problems solved by using GAs or hybrid techniques. Tips, 
hints or anything of help will be appreciated. Thanks in advance.

Regards,
Dragan Savic

