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 条
  • [21] K-PPM: A new exact method to solve multi-objective combinatorial optimization problems
    Dhaenens, C.
    Lemesre, J.
    Talbi, E. G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (01) : 45 - 53
  • [22] A modified grey wolf optimization algorithm to solve global optimization problems
    Gopi, S.
    Mohapatra, Prabhujit
    OPSEARCH, 2024, : 337 - 367
  • [23] A COMBINED APPROACH TO SOLVE BINARY MULTICRITERIA PROBLEMS
    BITRAN, GR
    RIVERA, JM
    NAVAL RESEARCH LOGISTICS, 1982, 29 (02) : 181 - 201
  • [24] A Constraint Partition Method for Combinatorial Optimization Problems
    Onoda, Makoto
    Komatsu, Kazuhiko
    Kumagai, Masahito
    Sato, Masayuki
    Kobayashi, Hiroaki
    2023 IEEE 16TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP, MCSOC, 2023, : 600 - 607
  • [25] ANALOG METHOD FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
    URAHAMA, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (01) : 302 - 308
  • [26] A Multiple Coefficients Trial Method to Solve Combinatorial Optimization Problems for Simulated-annealing-based Ising Machines
    Takehara, Kota
    Oku, Daisuke
    Matsuda, Yoshiki
    Tanaka, Shu
    Togawa, Nozomu
    2019 IEEE 9TH INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS (ICCE-BERLIN), 2019, : 64 - 69
  • [27] The bundle method for hard combinatorial optimization problems
    Gruber, G
    Rendl, F
    COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 78 - 88
  • [28] Development of algorithms to solve combinatorial problems
    Crawford, Broderick
    Castro, Carlos
    Monfroy, Eric
    ICEIS 2007: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS: INFORMATION SYSTEMS ANALYSIS AND SPECIFICATION, 2007, : 636 - +
  • [29] Reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
    Int J Approximate Reasoning, 1-2 (161-191):
  • [30] Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems
    Pemberton, JC
    Zhang, WX
    ARTIFICIAL INTELLIGENCE, 1996, 81 (1-2) : 297 - 325
12345