The parallelism in the algorithm of the synthesis of models of optimal complexity based on the genetic algorithms
DOI:
https://doi.org/10.15587/1729-4061.2014.26305Keywords:
empirical model, internal parallelism, algorithm graph, circle, circle width, algorithm graph height, computer system, parallel structureAbstract
An analysis of methods for constructing mathematical models has shown that one of the most promising methods for constructing such models is the inductive method of model self-organization that allows to obtain the model of optimal complexity. The disadvantage of this method is its high dimensionality, which limits the scope of this method. A method of the synthesis of models of optimal complexity based on the genetic algorithms, which has a much smaller dimensionality than the inductive method of model self-organization, can be an alternative to it. But for complex technical facilities with a large number of input variables, computing time expenditures are still quite noticeable. In order to reduce such expenditures, analysis of the method of constructing empirical models of optimal complexity based on the genetic algorithms of optimal complexity for parallelism by constructing the algorithm graphs was carried out. It was shown that this algorithm has an internal parallelism, which allows to develop an effective program of the algorithm implementation on a parallel-structure computer system, and this in turn would reduce the computer time expenditures at the practical implementation of the algorithm.References
- Gorbіjchuk, M. І., Shhupak, І. V., Oskolіp, T. (2011). Metod sintezu empіrichnih modelej z vrahuvannjam pohibok vimіrjuvan'. Metodi ta priladi kontrolju jakostі, 2 (27), 67–76.
- Gorbіjchuk, M. І., Shufnarovich, M. A. (2010). Metod pobudovi matematichnih modelej skladnih procesіv na zasadah genetichnih algoritmіv. Shtuchnij іntelekt, 4, 50–57.
- Voevodin, V. V., Voevodin, V. V. (2002). Parallel'nye vychislenija. SPb: BHV-Peterburg, 608.
- Ermakov, S. M., Zhigljavskij, A. A. (1987). Matematicheskaja teorija optimal'nogo jeksperimenta. Moscow: Nauka, 320.
- Ivahnenko, A. G. (1981). Induktivnyj metod samoorganizacii modelej slozhnyh sistem. Kiev: Naukova dumka, 296.
- Gorbіjchuk, M. І., Vasilenko, O. B., Shhupak, І. V. (2009). Metod sintezu empіrichnih modelej na zasadah genetichnih algoritmіv. Rozvіdka ta rozrobka naftovih і gazovih rodovishh, 4 (33), 72–79.
- Ortega, Dzh. (1991). Vvedenie v parallel'nye i vektornye metody reshenija linejnyh sistem. Moscow: Mir, 367.
- Bjebb, R., Mak-Grou, Dzh., Akselrod, T. (1991). Programmirovanie na parallel'nyh vychislitel'nyh sistemah. Moscow: Mir, 376.
- Himich, A. N., Molchanov, I. N., Popov, A. V. (2008). Parallel'nye algoritmy reshenija zadach vychislitel'noj matematiki. Kiev: Naukova dumka, 248.
- Ivahnenko, A. G., Koppa, Ju. V., Stepashko, V. S. (1980). Spravochnik po tipovym programmam modelirovanija. Kiev: Tehnіka, 180.
- Іvahnenko, O. G., Lapa, V. G. (1969). Peredbachennja vipadkovih procesіv. Kiev: Naukova dumka, 420.
- Gorbіjchuk, M. І., Kogutjak, M. І., Zajachuk, Ja. І. (2008). Іnduktivnij metod pobudovi matematichnih modelej gazoperekachuval'nih agregatіv prirodnogo gazu. Naftova і gazova promislovіst', 5, 32–35.
- Rutkovskaja, D., Pilins'kij, M., Rudkovskij, L. (2004). Nejronnye seti, geneticheskie algoritmy i nechetkie sistemy. Moscow: Gorjachaja linija-Telekom, 452.
- Voevodin, V. V. (2008). Vychislitel'naja matematika i struktura algoritmov. 10 lekcij. Moscow: I-vo MGU, 113.
- Volkov, E. A. (1987). Chislennye metody. Moscow: Nauka, 248.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 Михайло Іванович Горбійчук, Віра Михайлівна Медведчук, Богдан Васильович Пашковський
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
