Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!sdd.hp.com!hplabs!hpcc05!hpwrce!kingsley
From: kingsley@hpwrce.HP.COM (Kingsley Morse)
Newsgroups: comp.ai.neural-nets
Subject: Re: simulated annealing vs genetic algs.
Message-ID: <3430019@hpwrce.HP.COM>
Date: 1 Nov 90 20:07:07 GMT
References: <1990Oct31.172833.18197@ecn.purdue.edu>
Organization: HP Western Response Center
Lines: 6

Comparing GAs to SA is good. I know John Holland showed that GAs search their 
search "optimally", in a sense. Dave Whitley at Colorado State (?) has solved 
a "traveling salesman" problem with more cities (47?) than any other algorithm,
SA included. The main question I have is, which is more computationally
efficient for large problems. IE: which scales better for applications with
many variables.