Cite this article as:
Savin A. N. The application of optimization algorithm using simulated annealing method for parallel computing systems . Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2012, vol. 12, iss. 1, pp. 110-116. DOI: https://doi.org/10.18500/1816-9791-2012-12-1-110-116
The application of optimization algorithm using simulated annealing method for parallel computing systems
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. Орлянская И. В. Современные подходы к построению методов глобальной оптимизации // Электронный журнал «Исследовано в России». С. 2097–2108.URL: http://zhurnal.ape.relarn.ru/articles/2002/189.pdf
(дата обращения 02.12.2011).
2. Банди Б. Методы оптимизации : вводный курс. М.:Радио и связь, 1988. 128 с.
3. Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization
by simulated annealing // Science. 1983. Vol. 220. P. 671–680.
4. Калиткин Н. Н. Численные методы. М. : Наука,1978. 512 с.
5. Ingber L. Simulated Annealing: Practice versus theory // Mathematical and Computer Modelling. 1993.Vol. 18(11). P. 29–57.
6. Лопатин А. С. Метод отжига // Стохастическая оптимизация в информатике. СПб. : Изд-во СПбГУ, 2005.Вып. 1. С. 133–149.
7. Wilson J. D. Design of high-efficiency wide-band width coupled-cavity traveling-wave tube phase velocity tapers with simulated annealing algorithms // IEEE Trans.Electron Devices. Vol. 48. Jan. 2001. P. 95–100.
8. GigaSpaces eXtreme Application Platform (XAP). URL: http://www.gigaspaces.com/xap (дата обращения02.12.2011).
