Geodesic
The effectiveness analysis of several parallel algorithms based on simulated annealing method of global optimization problem solving
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 3, pp. 87-95 
A. V. Vysotsky; A. S. Tarakanov; K. I. Sholomov; N. E. Timofeeva; A. A. Eroftiev. The effectiveness analysis of several parallel algorithms based on simulated annealing method of global optimization problem solving. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 3, pp. 87-95. http://geodesic.mathdoc.fr/item/ISU_2013_13_3_a12/
@article{ISU_2013_13_3_a12,
     author = {A. V. Vysotsky and A. S. Tarakanov and K. I. Sholomov and N. E. Timofeeva and A. A. Eroftiev},
     title = {The effectiveness analysis of several parallel algorithms based on simulated annealing method of global optimization problem solving},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {87--95},
     year = {2013},
     volume = {13},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2013_13_3_a12/}
}
TY  - JOUR
AU  - A. V. Vysotsky
AU  - A. S. Tarakanov
AU  - K. I. Sholomov
AU  - N. E. Timofeeva
AU  - A. A. Eroftiev
TI  - The effectiveness analysis of several parallel algorithms based on simulated annealing method of global optimization problem solving
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2013
SP  - 87
EP  - 95
VL  - 13
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ISU_2013_13_3_a12/
LA  - ru
ID  - ISU_2013_13_3_a12
ER  - 
%0 Journal Article
%A A. V. Vysotsky
%A A. S. Tarakanov
%A K. I. Sholomov
%A N. E. Timofeeva
%A A. A. Eroftiev
%T The effectiveness analysis of several parallel algorithms based on simulated annealing method of global optimization problem solving
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2013
%P 87-95
%V 13
%N 3
%U http://geodesic.mathdoc.fr/item/ISU_2013_13_3_a12/
%G ru
%F ISU_2013_13_3_a12

Voir la notice de l'article provenant de la source Math-Net.Ru

This article presents the results of the development of a parallel computing system and testing its capabilities applied to solving scientific and educational problems. Three parallel variants of the simulated annealing algorithm are proposed and implemented for multiextreme criterion function of two variables with explicit constraints. The reliability and performance of parallel versions of the algorithm, depending on their parameters and the number of working nodes in parallel computing system, is investigated. It is shown that proposed parallel variants of simulating annealing algorithm allow successful finding the global minimum of multiextreme criterion function.

[1] Lopatin A. S., “Simulated Annealing”, Stochastic Optimization in Informatics, Iss. 1, St. Petersburg, 2005, 133–149

[2] Savin A. N., Timofeeva N. E., “Using Optimization Algorithm Based on Simulated Annealing on Parallel and Distributed Computing Systems”, Izv. Sarat. Univ., N.S., Ser. Math. Mech. Inform., 12:1 (2012), 110–116

[3] Kirkpatrick S. A., Gelatt C. D., Vecchi M. P., “Optimization by simulated annealing”, Science (N.S.), 220:4598 (1983), 671–680 | DOI | MR | Zbl