Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations

被引：5
|
作者：
Koliechkina L.N. [1 ]
Dvernaya O.A. [1 ]
Nagornaya A.N. [2 ]
机构：
[1] Poltava University of Economics and Trade, Poltava
[2] Ukrainian State University of Finance and International Trade, Kyiv
来源：
Cybernetics and Systems Analysis | 2014年 / 50卷 / 4期
关键词：
Combinatorial configurations; Coordinate method; Extremum problems; Extremum problems on combinatorial configurations; Multicriteriality condition;
D O I：
10.1007/s10559-014-9650-4
中图分类号：
学科分类号：
摘要：
We propose an approach to solve a multicriteria optimization problem on combinatorial configuration of permutations by using graph theory, taking into account the properties and structure of the set of permutations. The subprogram of the method of searching for configuration points that uses the coordinate method in the proposed modified approach is described. © 2014 Springer Science+Business Media New York.
引用
收藏
页码：620 / 626
页数：6
相关论文
共 50 条
  • [41] Application of the method of regularization to solve ill-posed problems of coordinate measurements
    Suslin, V. P.
    Dzhunkovskii, A. V.
    MEASUREMENT TECHNIQUES, 2009, 52 (07) : 719 - 724
  • [42] Multi-point combinatorial optimization method with estimation mechanism for landscape of combinatorial optimization problems
    Morita M.
    Ochiai H.
    Tamura K.
    Yasuda K.
    1600, Institute of Electrical Engineers of Japan (136): : 963 - 976
  • [43] An improved grammatical evolution approach for generating perturbative heuristics to solve combinatorial optimization problems
    Mweshi, George
    Pillay, Nelishia
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
  • [44] The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
    Moreno-Centeno, Erick
    Karp, Richard M.
    OPERATIONS RESEARCH, 2013, 61 (02) : 453 - 468
  • [45] How to Solve Combinatorial Optimization Problems Using Real Quantum Machines: A Recent Survey
    Heng, Sovanmonynuth
    Kim, Dongmin
    Kim, Taekyung
    Han, Youngsun
    IEEE ACCESS, 2022, 10 : 120106 - 120121
  • [46] A pattern-based evolving mechanism for genetic algorithm to solve combinatorial optimization problems
    Wang, Q
    Yung, KL
    Ip, WH
    SMCIA/03: PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL WORKSHOP ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, 2003, : 97 - 101
  • [47] A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems
    Kaya, Ebubekir
    Gorkemli, Beyza
    Akay, Bahriye
    Karaboga, Dervis
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2022, 115
  • [48] An improved grammatical evolution approach for generating perturbative heuristics to solve combinatorial optimization problems
    Mweshi, George
    Pillay, Nelishia
    Expert Systems with Applications, 2021, 165
  • [49] An Improved Vantage Point Bees Algorithm to Solve Combinatorial Optimization Problems from TSPLIB
    Zeybek, Sultan
    Ismail, Asrul Harun
    Hartono, Natalia
    Caterino, Mario
    Jiang, Kaiwen
    MACROMOLECULAR SYMPOSIA, 2021, 396 (01)
  • [50] Method of Solving Combinatorial Optimization Problems with Stochastic Effects
    Sota, Takahiro
    Hayakawa, Yoshihiro
    Sato, Shigeo
    Nakajima, Koji
    NEURAL INFORMATION PROCESSING, PT III, 2011, 7064 : 389 - +
12345