Using the min-max method to solve multiobjective optimization problems with genetic algorithms

被引:0
|
作者
Coello, CAC [1 ]
机构
[1] Univ Plymouth, Engn Design Ctr, Plymouth PL4 8AA, Devon, England
[2] Lab Nacl Informat Avanzada, LANIA, Xalapa, Veracruz, Mexico
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new multiobjective optimization technique based on the genetic algorithm (GA) is introduced. This method is based in the concept of min-max optimum, taken from the Operations Research literature, and can produce the Pareto set and the best trade-off among the objectives. The results produced by this approach are compared to those produced with other mathematical programming techniques and GA-based approaches using a multiobjective optimization tool called MOSES (Multiobjective Optimization of Systems in the Engineering Sciences). The importance of representation is hinted in the example used, since it can be seen that reducing the chromosomic length of an individual tends to produce better results in the optimization process, even if it's at the expense of a higher cardinality alphabet.
引用
收藏
页码:303 / 314
页数:12
相关论文
共 50 条
  • [1] TRAJECTORY-FOLLOWING ALGORITHMS FOR MIN-MAX OPTIMIZATION PROBLEMS
    VINCENT, TL
    GOH, BS
    TEO, KL
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1992, 75 (03) : 501 - 519
  • [2] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    [J]. Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [3] Improving the min-max method for multiobjective programming
    Salmei, Hossein
    Yaghoobi, Mohammad Ali
    [J]. OPERATIONS RESEARCH LETTERS, 2020, 48 (04) : 480 - 486
  • [4] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [5] Using Shapley Values and Genetic Algorithms to Solve Multiobjective Optimization Problems
    Wu, Hsien-Chung
    [J]. SYMMETRY-BASEL, 2021, 13 (11):
  • [6] Multiobjective genetic algorithms applied to solve optimization problems
    Dias, AHF
    de Vasconcelos, JA
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (02) : 1133 - 1136
  • [7] Co-evolutionary Particle Swarm Optimization to solve min-max problems
    Shi, YH
    Krohling, RA
    [J]. CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1682 - 1687
  • [8] Approximation Algorithms for Min-Max Generalization Problems
    Berman, Piotr
    Raskhodnikova, Sofya
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 53 - 66
  • [9] Approximation Algorithms for Min-Max Generalization Problems
    Berman, Piotr
    Raskhodnikova, Sofya
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (01)
  • [10] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
    Aissi H.
    [J]. 4OR, 2006, 4 (4) : 347 - 350