Please use this identifier to cite or link to this item:
|Title:||Optimization of linear functions on a cyclic permutation Based on the random search|
|Keywords:||combinatorial optimization, linear function, cyclic permutations, random search, branch and bound algorithm, parallel computing.|
|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.|
|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.|
|Appears in Collections:||Кафедра системотехніки (СТ)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.