A methodological approach to parallel simulated annealing on an SMP system.

DOI10.1006/JPDC.2002.1863MaRDI QIDQ1867350zbMATH OpenOpenAlexFDO

Authors A. Bevilacqua

Publication date 2 April 2003

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2002.1863

zbMATH Keywords

combinatorial optimizationdistributed computingmultithreading.parallel computingparallel simulated annealingshared memorySMP systemtraveling salesman problemTSP

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 124506
• A parallel algorithm of simulated annealing for multiprocessor scheduling
• Parallel processing in optimal structural design using simulated annealing
• A parallel simulated annealing algorithm
• Parallel simulated annealing by mixing of states

Cited in

(5)

• Generalized speculative computation of parallel simulated annealing
• Parallelizing simulated annealing algorithms based on high-performance computer
• scientific article; zbMATH DE number 1810465 (Why is no real title available?)
• scientific article; zbMATH DE number 2087678 (Why is no real title available?)
• Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems

This page was built for publication: A methodological approach to parallel simulated annealing on an SMP system.

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