A distributed implementation of simulated annealing for the travelling salesman problem

DOI10.1016/0167-8191(89)90106-3zbMath0679.65043OpenAlexW2004182374MaRDI QIDQ1822906

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

simulated annealing algorithmtravelling salesman problemimplementationtransputers

Mathematics Subject Classification ID

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

Related Items (9)

Solving large-scale TSP using a fast wedging insertion partitioning approach ⋮ Generalized speculative computation of parallel simulated annealing ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ Scheduling algorithms for real-time computing systems admitting simulation models ⋮ Parallel heuristic search -- introductions and a new approach ⋮ A parallel algorithm of simulated annealing for multiprocessor scheduling ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ A framework for multi-robot node coverage in sensor networks

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