Geodesic
The application of optimization algorithm using simulated annealing method for parallel computing systems
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 1, pp. 110-116 
A. N. Savin; N. E. Timofeeva. The application of optimization algorithm using simulated annealing method for parallel computing systems. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 1, pp. 110-116. http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a15/
@article{ISU_2012_12_1_a15,
     author = {A. N. Savin and N. E. Timofeeva},
     title = {The application of optimization algorithm using simulated annealing method for parallel computing systems},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {110--116},
     year = {2012},
     volume = {12},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a15/}
}
TY  - JOUR
AU  - A. N. Savin
AU  - N. E. Timofeeva
TI  - The application of optimization algorithm using simulated annealing method for parallel computing systems
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2012
SP  - 110
EP  - 116
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a15/
LA  - ru
ID  - ISU_2012_12_1_a15
ER  - 
%0 Journal Article
%A A. N. Savin
%A N. E. Timofeeva
%T The application of optimization algorithm using simulated annealing method for parallel computing systems
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2012
%P 110-116
%V 12
%N 1
%U http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a15/
%G ru
%F ISU_2012_12_1_a15

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

This article presents the results of the adaptation algorithm for searching the global minimum of multiextreme criterion function of great count of variables with constraints based on the method of simulated annealing algorithm for systems of parallel and distributed computing. The reliability of the searching global minimum, depending on the number of nodes of parallel computer system is investigated. Distributed simulated annealing algorithm using the scheme of quenching, created by Boltzmann allows to search out the area of the global minimum for a short time is represented.

[1] Orlyanskaya I. V., “Sovremennye podkhody k postroeniyu metodov globalnoi optimizatsii”, Elektronnyi zhurnal “Issledovano v Rossii”, 2097–2108

[2] Bandi B., Metody optimizatsii: vvodnyi kurs, Radio i svyaz, M., 1988, 128 pp.

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

[4] Kalitkin N. N., Chislennye metody, Nauka, M., 1978, 512 pp. | MR

[5] Ingber L., “Simulated Annealing: Practice versus theory”, Mathematical and Computer Modelling, 18:11 (1993), 29–57 | DOI | MR | Zbl

[6] Lopatin A. S., “Metod otzhiga”, Stokhasticheskaya optimizatsiya v informatike, 1, Izd-vo SPbGU, SPb., 2005, 133–149

[7] Wilson J. D., “Design of high-efficiency wide-bandwidth coupled-cavity traveling-wave tube phase velocity tapers with simulated annealing algorithms”, IEEE Trans. Electron Devices, 48, Jan. (2001), 95–100 | DOI

[8] GigaSpaces eXtreme Application Platform (XAP), URL: , (data obrascheniya 02.12.2011) http://www.gigaspaces.com/xap