Slow annealing versus multiple fast annealing runs - an empirical investigation

DOI10.1016/0167-8191(90)90063-FzbMath0718.65046OpenAlexW2062596410MaRDI QIDQ2639603

Nigel Dodd

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90063-f

zbMATH Keywords

combinatorial optimizationsimulated annealingparallel computingsplittingglobal minimum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items

An asynchronous decomposition approach to parallel global optimization, Metaheuristics: A bibliography, Parallel local search, TTT plots: a perl program to create time-to-target plots, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms