Paper: Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections

Authors:
Chang-Sung Jeong;Myung-Ho Kim
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1991

Citing 1
Cited 2

A Model of SIMD Machines and a Comparison of Various Interconnection Networks

IEEE Transactions on Computers

A modified inver-over operator for the traveling salesman problem

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

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.