RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2012 Volume 12, Issue 1, Pages 110–116 (Mi isu288)

This article is cited in 3 papers

Computer science

The application of optimization algorithm using simulated annealing method for parallel computing systems

A. N. Savin, N. E. Timofeeva

Saratov State University, Chair of Discrete Mathematics and Information Technologies

Abstract: 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.

Key words: global optimization, simulated annealing, multiextreme criterion function, parallel computing system.

UDC: 681.3.06+681.322

DOI: 10.18500/1816-9791-2012-12-1-110-116



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024