A distributed implementation of simulated annealing for the travelling salesman problem

DOI10.1016/0167-8191(89)90106-3MaRDI QIDQ1822906zbMATH OpenOpenAlexFDO

Authors James R. A. Allwright, D. B. Carpenter

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90106-3

zbMATH Keywords

implementationsimulated annealing algorithmtransputerstravelling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Nonlinear programming (90C30)

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.

Recommendations

• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 4085427
• scientific article; zbMATH DE number 238296
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• scientific article; zbMATH DE number 4095242

Cited in

(14)

• A framework for multi-robot node coverage in sensor networks
• Parallel processing for difficult combinatorial optimization problems
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• Generalized speculative computation of parallel simulated annealing
• Metaheuristics: A bibliography
• Parallel local search
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• Discrete heat transfer search for solving travelling salesman problem
• Scheduling algorithms for real-time computing systems admitting simulation models
• scientific article; zbMATH DE number 238296 (Why is no real title available?)
• Solution to the travelling salesperson problem using simulated annealing algorithm
• Parallel heuristic search -- introductions and a new approach
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem

This page was built for publication: A distributed implementation of simulated annealing for the travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822906)