On Improving the Constraint-Handling Performance with Modified Multiple Constraint Ranking (MCR-mod) for Engineering Design Optimization Problems Solved by Evolutionary Algorithms

被引:5
作者
Dwianto, Yohanes Bimo [1 ]
Fukumoto, Hiroaki [2 ]
Oyama, Akira [2 ]
机构
[1] Univ Tokyo, Tokyo 1138654, Japan
[2] Japan Aerosp Explorat Agcy, Inst Space & Aeronaut Sci, Sagamihara, Kanagawa 2525210, Japan
来源
PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19) | 2019年
关键词
Evolutionary algorithm; constraint handling technique; single-objective optimization;
D O I
10.1145/3321707.3321808
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work presents a new rank-based constraint handling technique (CHT) by implementing a modification on Multiple Constraint Ranking (MCR), a recently proposed rank-based constraint handling technique (CHT) for real-world engineering design optimization problems solved by evolutionary algorithms. The new technique, namely MCR-mod, not only maintains MCR's superior feature, i.e. balanced assessment of constraints with different orders of magnitude and/or different units, but also adds some more good features, such as more proper rank definition that the best feasible solution in the population always has better rank than the best infeasible solution, involvement of good infeasible solution, and easier way of implementation. Numerical experiments on benchmark problems from IEEE-CEC 2006 competition and engineering design are conducted to assess the accuracy and robustness of MCR-mod. From 25 independent runs on each problem, MCR-mod has proven its robustness compared to MCR, by its ability to produce better feasible optimal solution in most problems. Based on nonparametric statistical tests, there are indications that MCR-mod yields significant superiority in terms of accuracy compared with MCR on problems whose most constraints are inequality and active constraints, indicating that all added features of MCR-mod produce some improvements on the constraint-handling performance.
引用
收藏
页码:762 / 770
页数:9
相关论文
共 24 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHMS S
[2]  
[Anonymous], ENCY MACHINE LEARNIN, DOI DOI 10.1007/978-0-387-30164-8_630
[3]  
Barbosa H, 2008, FRONT EVOL ROBOT, DOI DOI 10.5772/5446
[4]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[5]  
Dorigo Marco., 2008, 6 INT C ANTS 2008 BR, V5217
[6]   A rank-based constraint handling technique for engineering design optimization problems solved by genetic algorithms [J].
Garcia, Rafael de Paula ;
Leite Pires de Lima, Beatriz Souza ;
de Castro Lemonge, Afonso Celso ;
Jacob, Breno Pinheiro .
COMPUTERS & STRUCTURES, 2017, 187 :77-87
[7]  
Gibbons J. D., 2011, Nonparametric Statistical Inference, DOI DOI 10.1007/978-3-642-04898-2_420
[8]   A survey of non-gradient optimization methods in structural engineering [J].
Hare, Warren ;
Nutini, Julie ;
Tesfamariam, Solomon .
ADVANCES IN ENGINEERING SOFTWARE, 2013, 59 :19-28
[9]   Performance evaluation of metaheuristic search techniques in the optimum design of real size pin jointed structures [J].
Hasancebi, O. ;
Carbas, S. ;
Dogan, E. ;
Erdal, F. ;
Saka, M. P. .
COMPUTERS & STRUCTURES, 2009, 87 (5-6) :284-302
[10]  
He Y., 2014, 32 AIAA APPL AER C, P2845