Handling bound constraints in CMA-ES: An experimental study

被引:32
作者
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
相关论文
共 42 条
[1]  
[Anonymous], METHOD HANDLING UNCE
[2]  
[Anonymous], CMA ES SOURCE CODE
[3]  
[Anonymous], SOURCES CMA PACKAGE
[4]  
[Anonymous], RESULTS IPOP CMA ES
[5]  
[Anonymous], 2016, ARXIV160503560
[6]  
[Anonymous], 2017, 13 BRAZ C COMP INT R
[7]  
[Anonymous], RR6829 INR
[8]  
[Anonymous], RR6828 INR
[9]  
Arabas J, 2010, LECT NOTES COMPUT SC, V6239, P411, DOI 10.1007/978-3-642-15871-1_42
[10]  
Arabas J, 2009, MIXDES 2009: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE MIXED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, P67