Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!ix.netcom.com!netcom.com!timin
From: timin@netcom.com (Mitchell E. Timin)
Subject: Re: TSP algorithms
Message-ID: <timinD04vwB.1yx@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: <vince-2811941628560001@newt2.harvard.edu>
Date: Thu, 1 Dec 1994 13:24:11 GMT
Lines: 12

vince@das.harvard.edu (Vince Darley) writes:

>I see quite a lot of posts here pertaining to the Travelling Salesman
>Problem. I was wondering what is considered the 'best' current algorithm
>for this problem. How do the evolutionary approaches compare?

In the recent TSP contest evolutionary approaches were not competitive
with other methods.  (see "TSP CONTEST - winners writeups", currently
posted in this newsgroup.)

Mitchell Timin

