Newsgroups: comp.parallel
From: ghis@alpha.lyon.sgi.com (Ghislain de Jacquelot)
Subject: Re: Traveling Salesman Problem
Organization: Silicon Graphics, Inc.
Date: Tue, 20 Jun 1995 15:48:33 GMT
Message-ID: <3s6qkh$8sq@murrow.corp.sgi.com>

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.  Also, various types of algorithms would be

Concerning the hardware, we (Silicon Graphics) solved a problem with 7397 
cities in june 94 with a ChallengeArray composed with 10 nodes, each node being 
a Challenge XL with 20 CPUs and 2 Gigabytes of Main Memory. (200 CPUs, 20GB 
Main memory).
No idea about the algorithm used.

|> 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.
|> 
|> 
-- 
#############################################################
#                               #                           #
#    Ghislain de Jacquelot      #   SGI Lyon - France       #
#        _____          ____    # Phone: (33).78.64.33.33   #
#       /     /    / @ /        # Fax  : (33).78.64.61.88   #
#      /  __ /____/ / /____     # Email: ghis@lyon.sgi.com  #
#     /    //    / /      /     # Vmail: 59362              #
#    /____//    / /  ____/      #                           #
#                               #                           #
#############################################################


