AN IMPROVED KRIGING ASSISTED MULTI-OBJECTIVE GENETIC ALGORITHM

被引:0
作者
Li, Mian [1 ]
机构
[1] Univ Michigan Shanghai Jiao Tong Univ Joint Inst, Shanghai 200240, Peoples R China
来源
PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE 2010, VOL 1, PTS A AND B | 2010年
关键词
ENGINEERING DESIGN; OPTIMIZATION; APPROXIMATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Although Genetic Algorithms (GAs) and Multi-Objective Genetic Algorithms (MOGAs) have been widely used in engineering design optimization, the important challenge still faced by researchers in using these methods is their high computational cost due to the population-based nature of these methods. For these problems it is important to devise MOGAs that can significantly reduce the number of simulation calls compared to a conventional MOGA. We present an improved kriging assisted MOGA, called Circled Kriging MOGA (CK-MOGA), in which kriging metamodels are embedded within the computation procedure of a traditional MOGA. In the proposed approach, the decision as to whether the original simulation or its kriging metamodel should be used for evaluating an individual is based on a new objective switch criterion and an adaptive metamodeling technique. The effect of the possible estimated error from the metamodel is mitigated by applying the new switch criterion. Three numerical and engineering examples with different degrees of difficulty are used to illustrate applicability of the proposed approach. The results show that, on the average, CK-MOGA outperforms both a conventional MOGA and our developed Kriging MOGA in terms of the number of simulation calls.
引用
收藏
页码:825 / 836
页数:12
相关论文
共 50 条
[41]   Kriging-Assisted Multi-Objective Design of Permanent Magnet Motor for Position Sensorless Control [J].
Li, Min ;
Gabriel, Fabien ;
Alkadri, Maria ;
Lowther, David A. .
IEEE TRANSACTIONS ON MAGNETICS, 2016, 52 (03)
[42]   An improved multi-objective genetic algorithm with heuristic initialization for service placement and load distribution in edge computing [J].
Maia, Adyson M. ;
Ghamri-Doudane, Yacine ;
Vieira, Dario ;
de Castro, Miguel Franklin .
COMPUTER NETWORKS, 2021, 194
[43]   Improved Multi-objective Genetic Algorithm Used to Optimizing Power Consumption of an Integrated System for Flexible Manufacturing [J].
Paun, Marius -Adrian ;
Coanda, Henri -George ;
Minca, Eugenia ;
Iliescu, Sergiu Stelian ;
Duca, Octavian Gabriel ;
Stamatescu, Grigore .
STUDIES IN INFORMATICS AND CONTROL, 2024, 33 (01) :27-36
[44]   A dynamic multi-objective evolutionary algorithm based on genetic engineering and improved particle swarm prediction strategy [J].
Yang, Yue ;
Ma, Yongjie ;
Zhao, Yan ;
Zhang, Wenping ;
Wang, Yu .
INFORMATION SCIENCES, 2024, 660
[45]   MOCSA: A Multi-Objective Crow Search Algorithm for Multi-Objective Optimization [J].
Nobahari, Hadi ;
Bighashdel, Ariyan .
2017 2ND CONFERENCE ON SWARM INTELLIGENCE AND EVOLUTIONARY COMPUTATION (CSIEC), 2017, :60-65
[46]   Multi-objective optimization based on parallel multi-families genetic algorithm [J].
Lu, Hai ;
Yan, Liexiang ;
Shi, Bin ;
Lin, Zixiong ;
Li, Xiaochun .
Huagong Xuebao/CIESC Journal, 2012, 63 (12) :3985-3990
[47]   Multi-objective optimization algorithm assisted by metamodels with applications in aerodynamics problems [J].
Gautier, Nelson Jose Diaz ;
Manzanare Filho, Nelson ;
Ramirez, Edna Raimunda da Silva .
APPLIED SOFT COMPUTING, 2022, 117
[48]   Multi-Objective Reinforcement Learning Algorithm and Its Improved Convergency Method [J].
Zhao Jin ;
Zhang Huajun .
2011 6TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2011, :2438-2445
[49]   An improved multi-objective evolutionary algorithm based on environmental and history information [J].
Hu, Ziyu ;
Yang, Jingming ;
Sun, Hao ;
Wei, Lixin ;
Zhao, Zhiwei .
NEUROCOMPUTING, 2017, 222 :170-182
[50]   An improved evolutionary algorithm for solving multi-objective crop planning models [J].
Sarker, Ruhul ;
Ray, Tapabrata .
COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2009, 68 (02) :191-199