Abstract
A parallel implementation of an algorithm devised for solving the traveling salesman problem is presented. The algorithm is simulated annealing, and is implemented on a hypercubic, MIMD computer of 64 processing nodes. The parallel algorithm is discussed and performance figures are given. Efficiencies greater than 90% have been achieved.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the International Conference on Parallel Processing |
Editors | Douglas DeGroot |
Publisher | IEEE |
Pages | 6-10 |
Number of pages | 5 |
ISBN (Print) | 0818606371 |
State | Published - Dec 1 1985 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture