Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!yeshua.marcam.com!usc!howland.reston.ans.net!pipex!uknet!cf-cm!thor.cf.ac.uk!speia
From: speia@thor.cf.ac.uk (Imran Ali)
Subject: Differnce between GA's and Traditonal Optimization Techniques
Message-ID: <21393.9410181016@thor.cf.ac.uk>
Sender: speia@thor.cf.ac.uk (Imran Ali)
Organization: University of Wales College of Cardiff, Cardiff, Wales, UK
Date: Tue, 18 Oct 1994 11:16:49 +0100
X-Mailer: Cardiff Computing Maths PP Mail Open News Gateway
Lines: 6

I shall be thankful if someone could let me know in a layman's language of
the following differnce of GA from traditional optimization techniques as
cited by Goldberg in his book.
         4. GA's use probablistic transition rules rather than
            deterministic rules.

