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
来源
EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS | 2007年 / 4403卷
关键词
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 条
  • [31] ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems
    Knowles, J
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (01) : 50 - 66
  • [32] Heterogeneous Ensemble-Based Infill Criterion for Evolutionary Multiobjective Optimization of Expensive Problems
    Guo, Dan
    Jin, Yaochu
    Ding, Jinliang
    Chai, Tianyou
    IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (03) : 1012 - 1025
  • [33] Dynamic Landscape Analysis for Constrained Multiobjective Optimization Problems
    Alsouly, Hanan
    Kirley, Michael
    Munoz, Mario Andres
    ADVANCES IN ARTIFICIAL INTELLIGENCE, AI 2023, PT I, 2024, 14471 : 429 - 441
  • [34] HANDLING DYNAMIC MULTIOBJECTIVE PROBLEMS WITH PARTICLE SWARM OPTIMIZATION
    Diaz Manriquez, Alan
    Toscano Pulido, Gregorio
    Ramirez Torres, Jose Gabriel
    ICAART 2010: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1: ARTIFICIAL INTELLIGENCE, 2010, : 337 - 342
  • [35] Multiobjective optimization inspired by behavior of jellyfish for solving structural design problems
    Chou, Jui-Sheng
    Dinh-Nhat Truong
    CHAOS SOLITONS & FRACTALS, 2020, 135
  • [36] Multiobjective Imperialist Competitive Algorithm for Solving Nonlinear Constrained Optimization Problems
    Chun-an LIU
    Huamin JIA
    Journal of Systems Science and Information, 2019, 7 (06) : 532 - 549
  • [37] Solving Multiobjective Optimization Problems Using Artificial Bee Colony Algorithm
    Zou, Wenping
    Zhu, Yunlong
    Chen, Hanning
    Zhang, Beiwei
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2011, 2011
  • [38] SUBGRADIENT ALGORITHM FOR SOLVING CONSTRAINED MULTIOBJECTIVE OPTIMIZATION PROBLEMS IN HILBERT SPACES
    Wang, W. E. N. T. I. N. G.
    An, A. I. M. I. N.
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2023, 24 (05) : 991 - 1003
  • [39] Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
    Ramirez, V. A.
    Sottosanto, G. N.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 81 (03) : 769 - 788
  • [40] Improved brain storm optimization algorithm for solving multimodal multiobjective problems
    Cheng S.
    Liu Y.
    Wang X.
    Jin H.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2024, 52 (06): : 24 - 31