Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!news.mathworks.com!newsfeed.internetmci.com!howland.reston.ans.net!EU.net!sun4nl!cs.vu.nl!news
From: Wook Heo <hwopscho>
Subject: Q: convergence
Nntp-Posting-Host: jol13.cs.vu.nl
X-Url: news:comp.ai.genetic
X-Mailer: Mozilla 1.1N (X11; I; SunOS 5.4 sun4c)
Content-Type: text/plain; charset=us-ascii
Sender: news@cs.vu.nl
Mime-Version: 1.0
Organization: computer science
Date: Wed, 11 Oct 1995 18:30:08 GMT
Message-ID: <DGArE9.IBA.0.-s@cs.vu.nl>
Content-Transfer-Encoding: 7bit
Lines: 12

Dear netters,

I would like to know if there are any theorems on the convergence and speed
of convergence of GAs.
GAs are heuristic search methods, therefore there is no guarantee that the
algorithm will converge to the optimal value (of whatever goal function) or
is there?

-- 
Princess Leia Organa:  I'd just as soon kiss a wookie!
Wook Heo ; hwopscho@cs.vu.nl

