Фрагментарные структуры в задачах дискретной оптимизации / Козин И. В., Максишко Н. К., Перепелица В. А. (2017)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2017, 53 (6))

Kozin I.V., Maksyshko N.K., Perepelitsa V.A.
Fragmentary structures in discrete optimization problems

The paper considers a combinatorial object (a fragmentary structure) and investigates the properties of this object. It is shown that a number of discrete optimization problems can be considered as optimization problems on a fragmentary structure. Optimization problem reduces to an unconditional combinatorial optimization problem on a set of permutations. Variants of algorithms to find approximate solutions for optimization problems of fragmentary structure are proposed. © 2017, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: ant algorithm, discrete optimization, evolutionary algorithm, fragmentary structure, local algorithm, Combinatorial optimization, Evolutionary algorithms, Shape optimization, Structural optimization, Ant algorithms, Approximate solution, Combinatorial objects, Combinatorial optimization problems, Discrete optimization, Discrete optimization problems, Local algorithm, Optimization problems, Optimization


Cite:
Kozin I.V., Maksyshko N.K., Perepelitsa V.A. (2017). Fragmentary structures in discrete optimization problems. Cybernetics and Systems Analysis, 53 (6), 125-131. doi: https://doi.org/10.1007/s10559-017-9995-6 http://jnas.nbuv.gov.ua/article/UJRN-0000782707 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна