FastPGA: A dynamic population sizing approach for solving expensive multiobjective optimization problems

被引:0
|
作者
Eskandari, Hamidreza [1 ]
Geiger, Christopher D. [1 ]
Lamont, Gary B. [2 ]
机构
[1] Univ Cent Florida, Dept Ind Engn & Management Syst, 4000 Cent Florida Blvd, Orlando, FL 32816 USA
[2] Air Force Inst Technol, Grad Schl Engn & Management, Dept Elect & Comp Engn, Wright Patterson AFB, OH 45433 USA
关键词
multiobjective optimization; evolutionary algorithms; Pareto optimality; fast convergence;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a new multiobjective evolutionary algorithm (MOEA), called fast Pareto genetic algorithm (FastPGA). FastPGA uses a new fitness assignment and ranking strategy for the simultaneous optimization of multiple objectives where each solution evaluation is computationally- and/or financially-expensive. This is often the case when there are time or resource constraints involved in finding a solution. A population regulation operator is introduced to dynamically adapt the population size as needed up to a user-specified maximum population size. Computational results for a number of well-known test problems indicate that FastPGA is a promising approach. FastPGA outperforms the improved nondominated sorting genetic algorithm (NSGA-II) within a relatively small number of solution evaluations.
引用
收藏
页码:141 / +
页数:3
相关论文
共 50 条
  • [21] On one approach for solving of some class of multiobjective optimization problems with interval coefficients
    Guseynov, Sharif E.
    Drobyshev, Sergey V.
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [23] Robust neutrosophic programming approach for solving intuitionistic fuzzy multiobjective optimization problems
    Firoz Ahmad
    Complex & Intelligent Systems, 2021, 7 : 1935 - 1954
  • [24] Efficient Global Optimization for Solving Computationally Expensive Bilevel Optimization Problems
    Islam, Md Monjurul
    Singh, Hemant Kumar
    Ray, Tapabrata
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 181 - 188
  • [25] A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
    Chugh, Tinkle
    Sindhya, Karthik
    Hakanen, Jussi
    Miettinen, Kaisa
    SOFT COMPUTING, 2019, 23 (09) : 3137 - 3166
  • [26] An XGBoost-assisted evolutionary algorithm for expensive multiobjective optimization problems
    Mao, Feiqiao
    Chen, Ming
    Zhong, Kaihang
    Zeng, Jiyu
    Liang, Zhengping
    INFORMATION SCIENCES, 2024, 666
  • [27] Multiproblem Surrogates: Transfer Evolutionary Multiobjective Optimization of Computationally Expensive Problems
    Min, Alan Tan Wei
    Ong, Yew-Soon
    Gupta, Abhishek
    Goh, Chi-Keong
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (01) : 15 - 28
  • [28] A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
    Tinkle Chugh
    Karthik Sindhya
    Jussi Hakanen
    Kaisa Miettinen
    Soft Computing, 2019, 23 : 3137 - 3166
  • [29] Dynamic grid-based uniform search for solving constrained multiobjective optimization problems
    Yuan, Jiawei
    MEMETIC COMPUTING, 2021, 13 (04) : 497 - 508
  • [30] Dynamic grid-based uniform search for solving constrained multiobjective optimization problems
    Jiawei Yuan
    Memetic Computing, 2021, 13 : 497 - 508