Target shape design optimization by evolving B-splines with cooperative coevolution

被引:16
作者
Yang, Zhenyu [1 ]
Sendhoff, B. [2 ]
Tang, Ke [3 ]
Yao, Xin [3 ,4 ]
机构
[1] Zhuiyi Tech Inc, Shenzhen 518000, Peoples R China
[2] Honda Res Inst Europe GmbH, Offenbach, Germany
[3] Univ Sci & Technol China, Sch Comp Sci & Technol, USTC Birmingham Joint Res Inst Intelligent Comput, Hefei 230027, Peoples R China
[4] Univ Birmingham, Sch Comp Sci, Ctr Excellence Res Computat Intelligence & Applic, Birmingham B15 2TT, W Midlands, England
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
Target shape design optimization; Cooperative coevolution; B-spline; Adaptive encoding; CMA-ES; DIFFERENTIAL EVOLUTION; ALGORITHM; COMPUTATION;
D O I
10.1016/j.asoc.2016.07.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With high reputation in handling non-linear and multi-model problems with little prior knowledge, evolutionary algorithms (EAs) have successfully been applied to design optimization problems as robust optimizers. Since real-world design optimization is often computationally expensive, target shape design optimization problems (TSDOPs) have been frequently used as efficient miniature model to check algorithmic performance for general shape design. There are at least three important issues in developing EAs for TSDOPs, i.e., design representation, fitness evaluation and evolution paradigm. Existing work has mainly focused on the first two issues, in which (1) an adaptive encoding scheme with B-spline has been proposed as a representation, and (2) a symmetric Hausdorff distance based metric has been used as a fitness function. But for the third issue, off-the-shelf EAs were used directly to evolve B-spline control points and/or knot vector. In this paper, we first demonstrate why it is unreasonable to evolve the control points and knot vector simultaneously. And then a new coevolutionary paradigm is proposed to evolve the control points and knot vector of B-spline separately in a cooperative manner. In the new paradigm, an initial population is generated for both the control points, and the knot vector. The two populations are evolved mostly separately in a round-robin fashion, with only cooperation at the fitness evaluation phase. The new paradigm has at least two significant advantages over conventional EAs. Firstly, it provides a platform to evolve both the control points and knot vector reasonably. Secondly, it reduces the difficulty of TSDOPs by decomposing the objective vector into two smaller subcomponents (i.e., control points and knot vector). To evaluate the efficacy of the proposed coevolutionary paradigm, an algorithm named CMA-ES-CC was formulated. Experimental studies were conducted based on two target shapes. The comparison with six other EAs suggests that the proposed cooperative coevolution paradigm is very effective for TSDOPs. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:672 / 682
页数:11
相关论文
共 39 条
[1]  
[Anonymous], 1997, THESIS
[2]  
Chang WW, 2003, IEEE C EVOL COMPUTAT, P1864
[3]   A binary differential evolution algorithm learning from explored solutions [J].
Chen, Yu ;
Xie, Weicheng ;
Zou, Xiufen .
NEUROCOMPUTING, 2015, 149 :1038-1047
[4]   A computationally efficient evolutionary algorithm for real-parameter optimization [J].
Deb, K ;
Anand, A ;
Joshi, D .
EVOLUTIONARY COMPUTATION, 2002, 10 (04) :371-395
[5]   Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems [J].
Gandomi, Amir Hossein ;
Yang, Xin-She ;
Alavi, Amir Hossein .
ENGINEERING WITH COMPUTERS, 2013, 29 (01) :17-35
[6]   COVNET:: A cooperative coevolutionary model for evolving artificial neural networks [J].
García-Pedrajas, N ;
Hervág-Martínez, C ;
Muñoz-Pérez, J .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2003, 14 (03) :575-596
[7]   Aerodynamic shape design using evolutionary algorithms and new gradient-assisted metamodels [J].
Giannakoglou, K. C. ;
Papadimitriou, D. I. ;
Kampolis, I. C. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2006, 195 (44-47) :6312-6329
[8]  
Hansen N, 2004, LECT NOTES COMPUT SC, V3242, P282
[9]   Completely derandomized self-adaptation in evolution strategies [J].
Hansen, N ;
Ostermeier, A .
EVOLUTIONARY COMPUTATION, 2001, 9 (02) :159-195
[10]   Drift analysis and average time complexity of evolutionary algorithms [J].
He, J ;
Yao, X .
ARTIFICIAL INTELLIGENCE, 2001, 127 (01) :57-85