Newsgroups: comp.parallel
From: marcov@win.tue.nl (Marco Verhoeven)
Subject: Re: Traveling Salesman Problem
Organization: Eindhoven University of Technology, the Netherlands
Date: Wed, 21 Jun 1995 12:38:00 GMT
Message-ID: <3s93r8$3nr@wsinis08.win.tue.nl>

In article <3s6qkh$8sq@murrow.corp.sgi.com>,
Ghislain de Jacquelot <ghis@alpha.lyon.sgi.com> wrote:
>
>Concerning the hardware, we (Silicon Graphics) solved a problem with 7397
>cities in june 94 with a ChallengeArray.

In fact, this instance was solved by Applegate, Bixby, Chvatal, Cook
from AT&T using an SG machine, but saying that this instance
was solved by SG is a little steep. 

>In article <3rurfe$jfi@mailer.fsu.edu>, Lynnetta Pressley <pressley@mailer.fsu.edu> writes:
>|> I am a student at Florida A & M University doing a senior design project on the
>|> traveling salesman problem and parallel computing.  If you have any information
>|> regarding this topic, please do not hesistate to respond.  In particular, I
>|> would like to know whether there are any valid solutions for any TSP with the
>|> number of cities greater than 318.  

There is a benchmark of real-world TSP instances available at 
http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html
containing instances with 85,900 cities.

>|> Also, various types of algorithms would be helpful so that they can be
>|> implemented and tested to see how they respond on a 
>|> parallel processor.  Please make sure that all algorithms are written in C.  I 
>|> would appreciate an e-mail of the program(s), or you can send it through the
>|> postal system.  My e-mail address is pressley@evax.eng.fsu.edu and my regular
>|> address is 2922 Miccosukee Rd. Apt. 7D, Tallahassee, FL, 32308. Thank you in
>|> advance.

We have designed a parallel algorithm for the TSP based on local
search that is able to find solutions within 2.6 % from optimality within
5 minutes for instances with up to 85,900 cities.
It is written in C and run on a Parsytec machine consisting of 32 PowerPC
processing units.

--
  Marco Verhoeven
  Department of Mathematics and Computing Science
  Eindhoven University of Technology
  P.O. Box 513  
  5600 MB Eindhoven, the Netherlands


