Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing

Chang-Sung Jeong, M. H. Kim

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

1 Citation (Scopus)

Abstract

The authors present a fast parallel simulated annealing algorithm for solving the traveling salesman problem (TSP) on single-instruction multiple-data (SIMD) machines with linear interconnections among processing elements. In the algorithm for TSP, it is shown that with the proper data distribution and movement schemes, the generation of a new configuration and the calculation of energy difference can be done in constant time, and the whole time complexity of the move operation is proportional to the time taken to broadcast one bit information on an acceptance decision to all the other processing elements (PEs) on a linear class computer with the same number of PEs as of cities. Therefore, if a control unit has the broadcasting capability, as is often the case with the SIMD machine, the move operation can be done in constant time and the whole simulated annealing algorithm has a time complexity only proportional to the number of moves.

Original languageEnglish
Title of host publicationProc 90 Int Conf Appl Specif Array Process
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages712-721
Number of pages10
ISBN (Print)0818690895
Publication statusPublished - 1991
Externally publishedYes
EventProceedings of the 1990 International Conference on Application Specific Array Processors - Princeton, NJ, USA
Duration: 1990 Sep 51990 Sep 7

Other

OtherProceedings of the 1990 International Conference on Application Specific Array Processors
CityPrinceton, NJ, USA
Period90/9/590/9/7

Fingerprint

Traveling salesman problem
Simulated annealing
Parallel algorithms
Processing
Broadcasting

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Jeong, C-S., & Kim, M. H. (1991). Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing. In Proc 90 Int Conf Appl Specif Array Process (pp. 712-721). Piscataway, NJ, United States: Publ by IEEE.

Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing. / Jeong, Chang-Sung; Kim, M. H.

Proc 90 Int Conf Appl Specif Array Process. Piscataway, NJ, United States : Publ by IEEE, 1991. p. 712-721.

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

Jeong, C-S & Kim, MH 1991, Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing. in Proc 90 Int Conf Appl Specif Array Process. Publ by IEEE, Piscataway, NJ, United States, pp. 712-721, Proceedings of the 1990 International Conference on Application Specific Array Processors, Princeton, NJ, USA, 90/9/5.
Jeong C-S, Kim MH. Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing. In Proc 90 Int Conf Appl Specif Array Process. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 712-721
Jeong, Chang-Sung ; Kim, M. H. / Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing. Proc 90 Int Conf Appl Specif Array Process. Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 712-721
@inproceedings{0a55eacae51e43538d1dacc68abe68f9,
title = "Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing",
abstract = "The authors present a fast parallel simulated annealing algorithm for solving the traveling salesman problem (TSP) on single-instruction multiple-data (SIMD) machines with linear interconnections among processing elements. In the algorithm for TSP, it is shown that with the proper data distribution and movement schemes, the generation of a new configuration and the calculation of energy difference can be done in constant time, and the whole time complexity of the move operation is proportional to the time taken to broadcast one bit information on an acceptance decision to all the other processing elements (PEs) on a linear class computer with the same number of PEs as of cities. Therefore, if a control unit has the broadcasting capability, as is often the case with the SIMD machine, the move operation can be done in constant time and the whole simulated annealing algorithm has a time complexity only proportional to the number of moves.",
author = "Chang-Sung Jeong and Kim, {M. H.}",
year = "1991",
language = "English",
isbn = "0818690895",
pages = "712--721",
booktitle = "Proc 90 Int Conf Appl Specif Array Process",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Parallel algorithm for traveling salesman problem on SIMD machines using simulated annealing

AU - Jeong, Chang-Sung

AU - Kim, M. H.

PY - 1991

Y1 - 1991

N2 - The authors present a fast parallel simulated annealing algorithm for solving the traveling salesman problem (TSP) on single-instruction multiple-data (SIMD) machines with linear interconnections among processing elements. In the algorithm for TSP, it is shown that with the proper data distribution and movement schemes, the generation of a new configuration and the calculation of energy difference can be done in constant time, and the whole time complexity of the move operation is proportional to the time taken to broadcast one bit information on an acceptance decision to all the other processing elements (PEs) on a linear class computer with the same number of PEs as of cities. Therefore, if a control unit has the broadcasting capability, as is often the case with the SIMD machine, the move operation can be done in constant time and the whole simulated annealing algorithm has a time complexity only proportional to the number of moves.

AB - The authors present a fast parallel simulated annealing algorithm for solving the traveling salesman problem (TSP) on single-instruction multiple-data (SIMD) machines with linear interconnections among processing elements. In the algorithm for TSP, it is shown that with the proper data distribution and movement schemes, the generation of a new configuration and the calculation of energy difference can be done in constant time, and the whole time complexity of the move operation is proportional to the time taken to broadcast one bit information on an acceptance decision to all the other processing elements (PEs) on a linear class computer with the same number of PEs as of cities. Therefore, if a control unit has the broadcasting capability, as is often the case with the SIMD machine, the move operation can be done in constant time and the whole simulated annealing algorithm has a time complexity only proportional to the number of moves.

UR - http://www.scopus.com/inward/record.url?scp=0025803312&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025803312&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025803312

SN - 0818690895

SP - 712

EP - 721

BT - Proc 90 Int Conf Appl Specif Array Process

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -