Multicriteria combinatorial optimization problems on a set of polypermutations

Abstract

519.85The studies on multicriteria combinatorial optimization are continued. A possible approach to solving multicriterion problems is developed and substantiated. An algorithm is developed and implemented. Some peculiarities of efficient solutions to multicriterion problems are described.

Modified Coordinate Method to Solve Multicriteria Optimization Problems on Combinatorial Configurations

“…The proposed approach differs from that described in [12]: first, the points of combinatorial configuration corresponding to the additional constraints are found, and the configuration element at which the function attains extremum value is determined among the set of these selected points [5]. And in the approach from [12], the solutions for which the function attains extremum are found first, conditions of the additional constraints are satisfied, and then the membership of the obtained solution in the considered combinatorial configuration is checked.…”

“…The present paper continues the studies in combinatorial optimization under multicriteriality condition [3,[8][9][10][11][12]. Our purpose is to develop a modified approach to the solution of the multicriteria problem on the set of permutations, to construct an algorithm for the modified approach, and to carry out a numerical experiment.…”

“…And in the approach from [12], the solutions for which the function attains extremum are found first, conditions of the additional constraints are satisfied, and then the membership of the obtained solution in the considered combinatorial configuration is checked.…”