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

Chang-Sung Jeong, Myung Ho Kim

Research output: Contribution to journalArticle

20 Citations (Scopus)

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 languageEnglish
Pages (from-to)221-228
Number of pages8
JournalParallel Computing
Volume17
Issue number2-3
Publication statusPublished - 1991 Jun 1
Externally publishedYes

Fingerprint

Traveling salesman problem
Simulated Annealing Algorithm
Travelling salesman problems
Simulated annealing
Simulated Annealing
Interconnection
Directly proportional
Broadcasting
Time Constant
Combinatorial Optimization Problem
Parallel Algorithms
Control Parameter
Broadcast
Time Complexity
Unit
Combinatorial optimization
Processing

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 journalArticle

@article{56b0f25d18e349a99f70fa58e70a9e0c,
title = "Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections",
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.",
keywords = "parallel implementation features, SIMD multi-processors, Simulated annealing, traveling salesman problem",
author = "Chang-Sung Jeong and Kim, {Myung Ho}",
year = "1991",
month = "6",
day = "1",
language = "English",
volume = "17",
pages = "221--228",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "2-3",

}

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

VL - 17

SP - 221

EP - 228

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 2-3

ER -