Approximate multi-objective optimization using conservative and feasible moving least squares method: application to automotive knuckle design

被引:0
作者
Chang Yong Song
Ha-Young Choi
Jongsoo Lee
机构
[1] Mokpo National University,Department of Ocean Engineering
[2] Dongyang Mirae University,Department of Mechanical Engineering
[3] Yonsei University,School of Mechanical Engineering
来源
Structural and Multidisciplinary Optimization | 2014年 / 49卷
关键词
Approximate multi-objective optimization; Pareto optimal solutions; Conservativeness and feasibility; Moving Least Squares Method (MLSM); Conservative and Feasible MLSM (CF-MLSM);
D O I
暂无
中图分类号
学科分类号
摘要
The original version of the moving least squares method (MLSM) does not always ensure solution feasibility for nonlinear and/or non-convex functions in the context of meta-model-based approximate optimization. The paper explores a new implementation of MLSM that ensures the conservative feasibility of Pareto optimal solutions in non-dominated sorting genetic algorithm (NSGA-II)-based approximate multi-objective optimization. We devised a ‘conservative and feasible MLSM’ (CF-MLSM) to realize the conservativeness and feasibility of multi-objective Pareto optimal solutions for both unconstrained and constrained problems. We verified the usefulness of our proposed approach by exploring strength-based sizing optimization of an automotive knuckle component under bump and brake loading constraints.
引用
收藏
页码:851 / 861
页数:10
相关论文
共 49 条
[1]  
Deb K(1995)Simulated binary crossover for continuous search space Complex Syst 9 115-148
[2]  
Agrawal RB(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 182-197
[3]  
Deb K(2007)Response surface approximation of pareto optimal front in multi-objective optimization Comput Methods Appl Mech Eng 196 879-893
[4]  
Pratap A(2008)Reliability-based design optimization using response surface method with prediction interval estimation J Mech Des 130 121401-1∼12
[5]  
Agarwal S(1999)Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization Evol Comput 7 19-44
[6]  
Meyarivan T(2007)GA based meta-modeling of BPN architecture for constrained approximate optimization Int J Solids Struct 44 5980-5993
[7]  
Goel T(2007)An enhancement of constraint feasibility in BPN based approximate optimization Comput Methods Appl Mech Eng 196 2147-2160
[8]  
Vaidyanathan R(2008)Derivative and GA based methods in meta-modeling of back-propagation neural networks for constraint approximate optimization Struct Multidiscip Optim 35 29-40
[9]  
Haftka RT(2008)A kriging metamodel assisted multi-objective genetic algorithm for design optimization J Mech Des Trans ASME 130 1-10
[10]  
Shyy W(1989)Designs for computer experiments Stat Sci 4 409-423