Handling bound constraints in CMA-ES: An experimental study

被引:29
|
作者
Biedrzycki, Rafal [1 ]
机构
[1] Warsaw Univ Technol, Inst Comp Sci, Warsaw, Poland
关键词
Bound constraints; CMA-ES; DIFFERENTIAL EVOLUTION; PARAMETER OPTIMIZATION; STRATEGY;
D O I
10.1016/j.swevo.2019.100627
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bound constraints are the lower and upper limits defined for each coordinate of the solution. There are many methods to deal with them, but there is no clear guideline for which of them should be preferred. This paper is devoted to handling bound constraints in the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. It surveys 22 Bound Constraint Handling Methods (BCHMs). The experiments cover both unimodal and multimodal functions taken from the CEC 2017 and the BBOB benchmarks. The performance of CMA-ES was found to change when different BCHMs were used. The worst and the best BCHMs were identified. The results of CMA-ES with the best BCHM and restarts were compared on CEC 2017 with the results of recently published derivatives of Differential Evolution (DE).
引用
收藏
页数:15
相关论文
共 50 条
  • [41] CMA-ES for One-Class Constraint Synthesis
    Karmelita, Marcin
    Pawlak, Tomasz P.
    GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 859 - 867
  • [42] Niche radius adaptation in the CMA-ES niching algorithm
    Shir, Ofer M.
    Back, Thomas
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN IX, PROCEEDINGS, 2006, 4193 : 142 - 151
  • [43] Making EGO and CMA-ES Complementary for Global Optimization
    Mohammadi, Hossein
    Le Riche, Rodolphe
    Touboul, Eric
    LEARNING AND INTELLIGENT OPTIMIZATION, LION 9, 2015, 8994 : 287 - 292
  • [44] Eigenspace sampling in the mirrored variant of (1, λ)-CMA-ES
    Au, Chun-Kit
    Leung, Ho-Fung
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [45] Warm Starting of CMA-ES for Contextual Optimization Problems
    Sekino, Yuta
    Uchida, Kento
    Shirakawa, Shinichi
    PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XVIII, PT II, PPSN 2024, 2024, 15149 : 205 - 220
  • [46] A (1+1)-CMA-ES for Constrained Optimisation
    Arnold, Dirk V.
    Hansen, Nikolaus
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 297 - 304
  • [47] Comparing the (1+1)-CMA-ES with a Mirrored (1+2)-CMA-ES with Sequential Selection on the Noiseless BBOB-2010 Testbed
    Auger, Anne
    Brockhoff, Dimo
    Hansen, Nikolaus
    GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2010, : 1543 - 1550
  • [48] Identifying Idealised Vectors for Emotion Detection Using CMA-ES
    Alshahrani, Mohammed
    Samothrakis, Spyridon
    Fasli, Maria
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 157 - 158
  • [49] Theoretical Foundation for CMA-ES from Information Geometry Perspective
    Youhei Akimoto
    Yuichi Nagata
    Isao Ono
    Shigenobu Kobayashi
    Algorithmica, 2012, 64 : 698 - 716
  • [50] Accurate Estimation of Analog Circuit Parameters by CMA-ES Method
    Hayashi, Kosuke
    Ichige, Koichi
    2020 INTERNATIONAL SYMPOSIUM ON ANTENNAS AND PROPAGATION (ISAP), 2021, : 39 - 40