Efficient Global Optimization for Solving Computationally Expensive Bilevel Optimization Problems

被引:8
|
作者
Islam, Md Monjurul [1 ]
Singh, Hemant Kumar [1 ]
Ray, Tapabrata [1 ]
机构
[1] Univ New South Wales, Sch Engn & Informat Technol, Canberra, ACT, Australia
关键词
ALGORITHM; DESIGN;
D O I
10.1109/CEC.2018.8477714
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A number of real-life optimization problems operate in hierarchical model, where a "leader" entity is trying to optimize its objective(s), while in response a "follower" entity is also optimizing its own objective(s). Such problems are referred to as bilevel optimization problems. Given their nested nature, they have additional challenges compared to the traditional single-level optimization problems. Recent studies in the domain make it evident that the number of function evaluations needed to solve such problems using evolutionary algorithms is excessive. Development of efficient techniques that could reduce this computational effort is therefore of significant interest. In our previous work, we proposed and studied the use of multiple surrogate assisted optimization (SAO) to reduce the required evaluations of the lower level problem. In this work, we extend the idea further through the use of efficient global optimization (EGO) in solving bilevel problems. We refer to the approach as BLEGO (bilevel EGO). Unlike the standard SAO techniques, EGO samples new infill locations based on expected improvement in the objective value. Two different versions of BLEGO are studied - one where EGO is used only at the lower level, and another where EGO is used at both levels. Numerical experiments are conducted on SMD benchmark problem suite and the results are compared with the previously developed surrogate assisted bilevel algorithm (SABLA) to demonstrate its efficacy.
引用
收藏
页码:181 / 188
页数:8
相关论文
共 50 条
  • [1] Bilevel-search particle swarm optimization for computationally expensive optimization problems
    Yuan Yan
    Qin Zhou
    Shi Cheng
    Qunfeng Liu
    Yun Li
    [J]. Soft Computing, 2021, 25 : 14357 - 14374
  • [2] Bilevel-search particle swarm optimization for computationally expensive optimization problems
    Yan, Yuan
    Zhou, Qin
    Cheng, Shi
    Liu, Qunfeng
    Li, Yun
    [J]. SOFT COMPUTING, 2021, 25 (22) : 14357 - 14374
  • [3] Methodology for Global Optimization of Computationally Expensive Design Problems
    Koullias, Stefanos
    Mavris, Dimitri N.
    [J]. JOURNAL OF MECHANICAL DESIGN, 2014, 136 (08)
  • [4] Integration of Ordinal Optimization with Ant Lion Optimization for Solving the Computationally Expensive Simulation Optimization Problems
    Horng, Shih-Cheng
    Lee, Chin-Tan
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (01): : 1 - 19
  • [5] Aesthetic Differential Evolution Algorithm for Solving Computationally Expensive Optimization Problems
    Poonia, Ajeet Singh
    Sharma, Tarun Kumar
    Sharma, Shweta
    Rajpurohit, Jitendra
    [J]. ADVANCES IN NATURE AND BIOLOGICALLY INSPIRED COMPUTING, 2016, 419 : 87 - 96
  • [6] A Highly Parallel Approach for Solving Computationally Expensive Multicriteria Optimization Problems
    Gergel, Victor
    Kozinov, Evgeny
    [J]. SUPERCOMPUTING (RUSCDAYS 2019), 2019, 1129 : 3 - 14
  • [7] Nested evolutionary algorithms for computationally expensive bilevel optimization problems: Variants and their systematic analysis
    Singh, Hemant Kumar
    Islam, Md Monjurul
    Ray, Tapabrata
    Ryan, Michael
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2019, 48 : 329 - 344
  • [8] A Neighborhood Regression Optimization Algorithm for Computationally Expensive Optimization Problems
    Zhou, Yuren
    He, Xiaoyu
    Chen, Zefeng
    Jiang, Siyu
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (05) : 3018 - 3031
  • [9] An algorithm for computationally expensive engineering optimization problems
    Yoel, Tenne
    [J]. INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2013, 42 (05) : 458 - 488
  • [10] EFFICIENT OPTIMIZATION OF COMPUTATIONALLY EXPENSIVE OBJECTIVE FUNCTIONS
    KARIDIS, JP
    TURNS, SR
    [J]. JOURNAL OF MECHANISMS TRANSMISSIONS AND AUTOMATION IN DESIGN-TRANSACTIONS OF THE ASME, 1986, 108 (03): : 336 - 339