Abstract
In this paper, we present a fast parallel simulated annealing algorithm for solving traveling salesman problem(TSP) on SIMD machines with linear interconnections among processing elements. Simulated annealing is a generally applicable algorithm for solving combinatorial optimization problems by generating a sequence of moves at decending values of a control parameter. In our algorithm for TSP, the move operation can be executed in proportional to the time taken to broadcast a bit in one processing element (PE) to all the other PE's. 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 the time complexity only proportional to the number of the moves.
| Original language | English |
|---|---|
| Pages (from-to) | 221-228 |
| Number of pages | 8 |
| Journal | Parallel Computing |
| Volume | 17 |
| Issue number | 2-3 |
| Publication status | Published - 1991 Jun 1 |
| Externally published | Yes |
Fingerprint
Keywords
- parallel implementation features
- SIMD multi-processors
- Simulated annealing
- traveling salesman problem
ASJC Scopus subject areas
- Control and Systems Engineering
- Hardware and Architecture
- Computer Science Applications
Cite this
Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections. / Jeong, Chang-Sung; Kim, Myung Ho.
In: Parallel Computing, Vol. 17, No. 2-3, 01.06.1991, p. 221-228.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections
AU - Jeong, Chang-Sung
AU - Kim, Myung Ho
PY - 1991/6/1
Y1 - 1991/6/1
N2 - In this paper, we present a fast parallel simulated annealing algorithm for solving traveling salesman problem(TSP) on SIMD machines with linear interconnections among processing elements. Simulated annealing is a generally applicable algorithm for solving combinatorial optimization problems by generating a sequence of moves at decending values of a control parameter. In our algorithm for TSP, the move operation can be executed in proportional to the time taken to broadcast a bit in one processing element (PE) to all the other PE's. 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 the time complexity only proportional to the number of the moves.
AB - In this paper, we present a fast parallel simulated annealing algorithm for solving traveling salesman problem(TSP) on SIMD machines with linear interconnections among processing elements. Simulated annealing is a generally applicable algorithm for solving combinatorial optimization problems by generating a sequence of moves at decending values of a control parameter. In our algorithm for TSP, the move operation can be executed in proportional to the time taken to broadcast a bit in one processing element (PE) to all the other PE's. 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 the time complexity only proportional to the number of the moves.
KW - parallel implementation features
KW - SIMD multi-processors
KW - Simulated annealing
KW - traveling salesman problem
UR - http://www.scopus.com/inward/record.url?scp=0026171861&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026171861&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0026171861
VL - 17
SP - 221
EP - 228
JO - Parallel Computing
JF - Parallel Computing
SN - 0167-8191
IS - 2-3
ER -