Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Valery G. Kobak"'
THE ALGORITHMIC APPROACH TO IMPROVEMENT OF WORK GENETIC ALGORITHM IN THE HOMOGENEOUS MINIMAX PROBLEM
Publikováno v:
Вестник Донского государственного технического университета, Vol 10, Iss 4, Pp 474-479 (2018)
The given work states an estimation to two updatings of genetic algorithm which give decisions very close to optimum, for polynom time. Both these of algorithm, lead, finally, to the decision of a two-instrument minimax problem, however on various co
Externí odkaz:
https://doaj.org/article/e1aadfaa8ae547bf844d0821c2633ed8
Autor:
Valery G. Kobak, Mikhail A. Muratov
Publikováno v:
Вестник Донского государственного технического университета, Vol 11, Iss 7, Pp 1132-1135 (2018)
V.N.Plotnikov - V.J.Zverev list algorithm is examined. Minimax, quadratic and cubic criteria are used. The software for the analysis of criteria efficiency is developed.
Externí odkaz:
https://doaj.org/article/343e423454b74f809625b75cf51f04fb
Publikováno v:
Advanced Engineering Research, Vol 17, Iss 3, Pp 137-144 (2017)
Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits. It defines relevance of searching methods to improve the solution effic
Externí odkaz:
https://doaj.org/article/76db3e24714d413694c5a3340b367a24
Publikováno v:
Advanced Engineering Research, Vol 16, Iss 3, Pp 125-132 (2016)
The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveye
Externí odkaz:
https://doaj.org/article/d5f06be1213d48d8832e411a53ac13f8
Autor:
Valery G. Kobak, Irma S. Rudova
Publikováno v:
Advanced Engineering Research, Vol 16, Iss 2, Pp 129-135 (2016)
The work objective is to study a critical traveling salesman problem which is NP complicated task of the discrete optimization. It is shown that only heuristics is appropriate in achieving this goal. The result of the ant colony algorithm (ACA) and g
Externí odkaz:
https://doaj.org/article/01ed37a151ae4995b25044afd24aab61
Autor:
Valery G. Kobak, Mikhail A. Muratov
Publikováno v:
Advanced Engineering Research, Vol 11, Iss 7, Pp 1132-1135 (2011)
V.N.Plotnikov - V.J.Zverev list algorithm is examined. Minimax, quadratic and cubic criteria are used. The software for the analysis of criteria efficiency is developed.
Externí odkaz:
https://doaj.org/article/ca7ba0dceb5243cf96e906914778b8a8
THE ALGORITHMIC APPROACH TO IMPROVEMENT OF WORK GENETIC ALGORITHM IN THE HOMOGENEOUS MINIMAX PROBLEM
Publikováno v:
Advanced Engineering Research, Vol 10, Iss 4, Pp 474-479 (2010)
The given work states an estimation to two updatings of genetic algorithm which give decisions very close to optimum, for polynom time. Both these of algorithm, lead, finally, to the decision of a two-instrument minimax problem, however on various co
Externí odkaz:
https://doaj.org/article/8663acfa0aa04fed974bffd95b9ac58b
Publikováno v:
Advanced Engineering Research, Vol 19, Iss 4, Pp 389-397 (2019)
Introduction. Practical tasks (location of service points, creation of microcircuits, scheduling, etc.) often require an exact or approximate to exact solution at a large dimension. In this case, achieving an acceptable result requires solving a set
Publikováno v:
Advanced Engineering Research, Vol 16, Iss 3, Pp 125-132 (2016)
The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveye
Autor:
Valery G. Kobak, I. Sh. Rudova
Publikováno v:
Vestnik komp'iuternykh i informatsionnykh tekhnologii. :3-7