A distributed implementation of simulated annealing for the travelling salesman problem
type: Item
instance of: scholarly article
title: A distributed implementation of simulated annealing for the travelling salesman problem
zbMATH Open document ID: 0679.65043
DOI: 10.1016/0167-8191(89)90106-3
author: James R. A. Allwright
author: D. B. Carpenter
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
review text: The authors describe a novel implementation of the simulated annealing algorithm for finding an approximate solution of the travelling salesman problem. The implementation was on an array of Inmos T4/4 transputers, programmed in Occam 2. The authors claim they were able to compute solutions which appeared to be reasonably good to a problem of several thousand towns.
reviewed by: Milan Vlach
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4113872
zbMATH Keywords: implementation
zbMATH Keywords: simulated annealing algorithm
zbMATH Keywords: travelling salesman problem
zbMATH Keywords: transputers
MaRDI profile type: Publication
full work available at URL: 0167-8191(89)90106-3
OpenAlex ID: W2004182374
description: scientific article; zbMATH DE number 4113872