TRAVELING SALEMAN PROBLEM ON A HYPERCUBIC, MIMD COMPUTER.

Edward William Felten, Scott Karlin, Steve W. Otto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsDouglas DeGroot
PublisherIEEE
Pages6-10
Number of pages5
ISBN (Print)0818606371
StatePublished - Dec 1 1985
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'TRAVELING SALEMAN PROBLEM ON A HYPERCUBIC, MIMD COMPUTER.'. Together they form a unique fingerprint.

  • Cite this

    Felten, E. W., Karlin, S., & Otto, S. W. (1985). TRAVELING SALEMAN PROBLEM ON A HYPERCUBIC, MIMD COMPUTER. In D. DeGroot (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 6-10). IEEE.