A new algorithm for the traveling salesman problem on networked workstations
In this paper we present a new parallel algorithm for solving traveling salesman problem (TSP). Our algorithm is based on a local optimization method and it was implemented on networked workstations using PVM. The obtained efficiency is 70% on 6 × SUN SPARCstation IPX. It is shown that networked workstations can be efficiently used for solving TSP problem.
Unable to display preview. Download preview PDF.
- Garey, M.R., Johnson, D.S., “Computers and intractability: a guide to the theory of NP-completess”, W.H. Freeman, San Francisco, 1979.Google Scholar
- Lenstra, J.K., Rinnooy Kan, A.H.G.,“Some Simple Application of the Traveling Salesman Problem”, Oper. Res 26, 717–733, (1975).Google Scholar
- Laporte, G., “The Traveling Salesman Problem: An overview of exact and approximate algorithms”, European Journal of Operational Research, 59, (1992) 231–247.Google Scholar
- Christofides, N., “The traveling salesman problem — survey”, Tech. Rep., Imperial Collage, London, 1980Google Scholar
- Sunderam, V.S., “PVM: a framework for parallel distributed computing”, Concurrency: Practice and Experience, 2 (1990) 315–339.Google Scholar
- [5a]Geist, A. Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V., “PVM 3.0 A users' guide and reference manual”, ORNL/TM-12187, USA (February, 1993).Google Scholar
- G. Reinelt, TSPLIB 1.0, Contact: email@example.com.Google Scholar
- Lin, S., “Computer solution of the traveling salesman problem”, The Bell System Technical Journal, December 1965, 2245–2269.Google Scholar
- Dueck, G., Sheuler, T., “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anniealing”, Journal of Computational Physics, 90 (1990) 161–175.Google Scholar
- Lin, S., Kernighan, B.W., “An effective heuristic algorithm for the traveling salesman problem”, Oper. Res. 21, 498–516 (1973).Google Scholar