Newsgroups: comp.parallel
From: kale@cs.uiuc.edu
Subject: Re: Travelling Salesman Problem, advice concerning?
Keywords: TSP
Organization: Dept. of Computer Sci - University of Illinois
Date: Mon, 13 Feb 1995 13:01:48 GMT
Message-ID: <3hdqte$4gv@vixen.cso.uiuc.edu>



You may want to look at our paper cited below. It includes results on a 
TSP problem with 60 cities, although it doesn't use any strong OR/LP methods.
Interesteing aspects of the paper are methods for gaining consistent
speedup despite the speculative nature of parallelism, and a strategy 
for balancing not just the load, but simultenuously memory usage and
 priorities. (includes results upto 512 proc. with good speedups).

@INPROCEEDINGS{k:9IPPS,
        author = "Amitabh Sinha and L.V. Kale",
        title = "A Load Balancing Strategy for Prioritized Execution of Tasks",
        booktitle="International Parallel Processing Symposium", 
        address = "New Port Beach, CA.",
        month = "April",
        year = "1993",
        group = Y,
}

For "real" problems, you should distinguish between symmetric and asymetric
TSP  problems and use some of the strong methods such as those used by
Pekney and Miller. With strong algorithmic methods you can go to thousands 
of cities, just sequentially.

	-- L.V. Kale (kale@cs.uiuc.edu)



