A distributed implementation of simulated annealing for the travelling salesman problem (Q1822906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1822906 |
scientific article; zbMATH DE number 4113872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed implementation of simulated annealing for the travelling salesman problem |
scientific article; zbMATH DE number 4113872 |
Statements
A distributed implementation of simulated annealing for the travelling salesman problem (English)
0 references
1989
0 references
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.
0 references
implementation
0 references
simulated annealing algorithm
0 references
travelling salesman problem
0 references
transputers
0 references
0.8242515921592712
0 references
0.8039577007293701
0 references
