### 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 language | English |
---|---|

Title of host publication | Proc 90 Int Conf Appl Specif Array Process |

Place of Publication | Piscataway, NJ, United States |

Publisher | Publ by IEEE |

Pages | 712-721 |

Number of pages | 10 |

ISBN (Print) | 0818690895 |

Publication status | Published - 1991 |

Externally published | Yes |

Event | Proceedings of the 1990 International Conference on Application Specific Array Processors - Princeton, NJ, USA Duration: 1990 Sep 5 → 1990 Sep 7 |

### Other

Other | Proceedings of the 1990 International Conference on Application Specific Array Processors |
---|---|

City | Princeton, NJ, USA |

Period | 90/9/5 → 90/9/7 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -