Direct method for uncertain multi-objective optimization based on interval non-dominated sorting

被引:18
作者
Liu, Guiping [1 ]
Liu, Sheng [1 ]
机构
[1] Hunan Univ, Coll Mech & Vehicle Engn, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Uncertain multi-objective optimization; Interval non-dominated sorting; General crowding distance; Multi-objective genetic algorithm; Crashworthiness; LINEAR-PROGRAMMING PROBLEMS; OBJECTIVE FUNCTIONS; GENETIC ALGORITHM; DESIGN;
D O I
10.1007/s00158-020-02530-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The interval optimization methods which describe the uncertainty by intervals are widely used in uncertain multi-objective optimization. Commonly, the interval values of the objective functions are substituted by approximate values, which will cause the loss of accuracy. To deal with the problem, a direct method is presented in this paper. In the framework of the multi-objective genetic algorithm, the upper and lower boundaries of the objective and constraint functions are found using the Monte Carlo stochastic simulation method and the constraints are handled by the degree of interval constraint violation; and then every two individuals from the combination population of the evolutionary population and the external elite population are compared using the interval comparison method. Afterwards, an interval non-dominated sorting based on the interval dominance relations is performed to sort the combination population into different non-dominated level. Furthermore, a general crowding distance is calculated for each individual to make individuals from the same non-dominated level comparable and also to maintain the diversity. The efficiency and accuracy of the proposed method is demonstrated by three test functions, the multi-objective structural optimization of the ten-bar truss, and the multi-objective structural optimization of a vehicle body for crashworthiness and lightweight.
引用
收藏
页码:729 / 745
页数:17
相关论文
共 39 条
[1]  
[Anonymous], 1964, MONTE CARLO METHODS
[2]   Robust design of structures using convex models [J].
Au, FTK ;
Cheng, YS ;
Tham, LG ;
Zeng, GW .
COMPUTERS & STRUCTURES, 2003, 81 (28-29) :2611-2619
[3]   A multi-objective stochastic programming approach for supply chain design considering risk [J].
Azaron, A. ;
Brown, K. N. ;
Tarim, S. A. ;
Modarres, M. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 116 (01) :129-138
[4]   A generic fuzzy approach for multi-objective optimization under uncertainty [J].
Bahri, Oumayma ;
Talbi, El-Ghazali ;
Ben Amor, Nahla .
SWARM AND EVOLUTIONARY COMPUTATION, 2018, 40 :166-183
[5]  
Birge J. R., 1997, INTRO STOCHASTIC PRO
[6]   Multiobjective programming in optimization of interval objective functions - A generalized approach [J].
Chanas, S ;
Kuchta, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (03) :594-598
[7]   Direct optimization of uncertain structures based on degree of interval constraint violation [J].
Cheng, Jin ;
Liu, Zhenyu ;
Wu, Zhenyu ;
Tang, Mingyang ;
Tan, Jianrong .
COMPUTERS & STRUCTURES, 2016, 164 :83-94
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   Evolutionary algorithms for optimization problems with uncertainties and hybrid indices [J].
Gong, Dun-wei ;
Qin, Na-na ;
Sun, Xiao-yan .
INFORMATION SCIENCES, 2011, 181 (19) :4124-4138
[10]   Possibilistic linear programming:: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem [J].
Inuiguchi, M ;
Ramík, J .
FUZZY SETS AND SYSTEMS, 2000, 111 (01) :3-28