A distributed implementation of simulated annealing for the travelling salesman problem (Q1822906)

From MaRDI portal
Revision as of 23:23, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A distributed implementation of simulated annealing for the travelling salesman problem
scientific article

    Statements

    A distributed implementation of simulated annealing for the travelling salesman problem (English)
    0 references
    0 references
    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
    0 references
    implementation
    0 references
    simulated annealing algorithm
    0 references
    travelling salesman problem
    0 references
    transputers
    0 references

    Identifiers