Optimization of linear functions on a cyclic permutation  Based on the random search

Grebennik, I.; Baranov, A.; Chorna, O.; Gorbacheva, E.

Публікація:
Optimization of linear functions on a cyclic permutation Based on the random search

dc.contributor.author	Grebennik, I.
dc.contributor.author	Baranov, A.
dc.contributor.author	Chorna, O.
dc.contributor.author	Gorbacheva, E.
dc.date.accessioned	2017-06-08T16:20:58Z
dc.date.available	2017-06-08T16:20:58Z
dc.date.issued	2016
dc.description.abstract	For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.	uk_UA
dc.identifier.citation	Grebennik Igor. Optimization of linear functions on a cyclic permutation Based on the random search / Igor Grebennik, Alexey Baranov, Olga Chorna, Elena Gorbacheva // ECONTECHMOD. AN INTERNATIONAL QUARTERLY JOURNAL. – 2016. – Vol. 5, No. 3. – Р. 211–216.	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/3807
dc.language.iso	en	uk_UA
dc.subject	combinatorial optimization, linear function, cyclic permutations, random search, branch and bound algorithm, parallel computing.	uk_UA
dc.title	Optimization of linear functions on a cyclic permutation Based on the random search	uk_UA
dc.type	Article	uk_UA
dspace.entity.type	Publication