An Improved Kriging Assisted Multi-Objective Genetic Algorithm

Author(s):  
Mian Li

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.

2011 ◽  
Vol 133 (7) ◽  
Author(s):  
Mian Li

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. An improved kriging-assisted MOGA, called Circled Kriging MOGA (CK-MOGA), is presented in this paper, 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 and advanced 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. Five numerical and engineering examples with different degrees of difficulty are used to illustrate applicability of the proposed approach, with the verification using different quality measures. The results show that, on the average, CK-MOGA outperforms both a conventional MOGA and a previously developed Kriging MOGA in terms of the number of simulation calls.


2009 ◽  
Vol 131 (10) ◽  
Author(s):  
Josu Aguirrebeitia ◽  
Carlos Angulo ◽  
Luis M. Macareno ◽  
Rafael Avilés

A metamodeling methodology is applied to reduce the large computational cost required in the design of variable geometry trusses (VGTs). Using this methodology, submodels of finite elements within a complete FE model of the VGT are substituted by groups of fewer elements called equivalent parametric macroelements (EPMs). The EPM optimum parameters are obtained using equivalence criteria based on elastic energy and inertial properties. The optimization process is performed using nonlinear least square minimization and genetic algorithms.


2016 ◽  
pp. 172-186
Author(s):  
Bhabani Shankar Prasad Mishra ◽  
Subhashree Mishra ◽  
Sudhansu Sekhar Singh

The objective of this paper is to study the existing and current research on parallel multi-objective genetic algorithms (PMOGAs) through an intensive experiment. Many early efforts on parallelizing multi-objective genetic algorithms were introduced to reduce the processing time needed to reach an acceptable solution of them with various examples. Further, the authors tried to identify some of the issues that have not yet been studied systematically under the umbrella of parallel multi-objective genetic algorithms. Finally, some of the potential application of parallel multi objective genetic algorithm is discussed.


2019 ◽  
Vol 37 (2) ◽  
pp. 753-788
Author(s):  
Slawomir Koziel ◽  
Adrian Bekasiewicz

Purpose The purpose of this paper is to investigate the strategies and algorithms for expedited design optimization of microwave and antenna structures in multi-objective setup. Design/methodology/approach Formulation of the multi-objective design problem-oriented toward execution of the population-based metaheuristic algorithm within the segmented search space is investigated. Described algorithmic framework exploits variable fidelity modeling, physics- and approximation-based representation of the structure and model correction techniques. The considered approach is suitable for handling various problems pertinent to the design of microwave and antenna structures. Numerical case studies are provided demonstrating the feasibility of the segmentation-based framework for the design of real-world structures in setups with two and three objectives. Findings Formulation of appropriate design problem enables identification of the search space region containing Pareto front, which can be further divided into a set of compartments characterized by small combined volume. Approximation model of each segment can be constructed using a small number of training samples and then optimized, at a negligible computational cost, using population-based metaheuristics. Introduction of segmentation mechanism to multi-objective design framework is important to facilitate low-cost optimization of many-parameter structures represented by numerically expensive computational models. Further reduction of the design cost can be achieved by enforcing equal-volumes of the search space segments. Research limitations/implications The study summarizes recent advances in low-cost multi-objective design of microwave and antenna structures. The investigated techniques exceed capabilities of conventional design approaches involving direct evaluation of physics-based models for determination of trade-offs between the design objectives, particularly in terms of reliability and reduction of the computational cost. Studies on the scalability of segmentation mechanism indicate that computational benefits of the approach decrease with the number of search space segments. Originality/value The proposed design framework proved useful for the rapid multi-objective design of microwave and antenna structures characterized by complex and multi-parameter topologies, which is extremely challenging when using conventional methods driven by population-based metaheuristics algorithms. To the authors knowledge, this is the first work that summarizes segmentation-based approaches to multi-objective optimization of microwave and antenna components.


2008 ◽  
Vol 130 (3) ◽  
Author(s):  
M. Li ◽  
G. Li ◽  
S. Azarm

The high computational cost of population based optimization methods, such as multi-objective genetic algorithms (MOGAs), has been preventing applications of these methods to realistic engineering design problems. The main challenge is to devise methods that can significantly reduce the number of simulation (objective∕constraint functions) calls. We present a new multi-objective design optimization approach in which the Kriging-based metamodeling is embedded within a MOGA. The proposed approach is called Kriging assisted MOGA, or K-MOGA. The key difference between K-MOGA and a conventional MOGA is that in K-MOGA some of the design points are evaluated on-line using Kriging metamodeling instead of the actual simulation model. The decision as to whether the simulation or its Kriging metamodel should be used for evaluating a design point is based on a simple and objective criterion. It is determined whether by using the objective∕constraint functions’ Kriging metamodels for a design point, its “domination status” in the current generation can be changed. Seven numerical and engineering examples with different degrees of difficulty are used to illustrate applicability of the proposed K-MOGA. The results show that on the average K-MOGA converges to the Pareto frontier with an approximately 50% fewer number of simulation calls compared to a conventional MOGA.


Author(s):  
Javier Naranjo-Pérez ◽  
Andrés Sáez ◽  
Javier F. Jiménez-Alonso ◽  
Pablo Pachón ◽  
Víctor Compán

<p>The finite element model (FE) updating is a calibration method that allows minimizing the discrepancies between the numerical and experimental modal parameters. As result, a more accurate FE model is obtained and the structural analysis can represent the real behaviour of the structure. However, it is a high computational cost process. To overcome this issue, alternative techniques have been developed. This study focuses on the use of the unscented Kalman filter (UKF), which is a local optimization algorithm based on statistical estimation of parameters taken into account the measurements. The dome of a real chapel is considered as benchmark structure. A FE model is updated applying two different algorithms: (i) the multi-objective genetic algorithm and (ii) a hybrid unscented Kalman filter-multi-objective genetic algorithm (UKF-MGA). Finally, a discussion of the results will be presented to compare the performance of both algorithms.</p>


Author(s):  
Leshi Shu ◽  
Ping Jiang ◽  
Qi Zhou ◽  
Xiangzheng Meng ◽  
Yahui Zhang

Multi-objective genetic algorithms (MOGAs) are effective ways for obtaining Pareto solutions of multi-objective optimization problems. However, the high computational cost of MOGAs limits their applications to practical engineering optimization problems involving computational expensive simulations. To address this issue, a variable-fidelity metamodel (VFM) assisted MOGA approach is proposed, in which VFM is embedded in the computation process of MOGA to replace expensive simulation models. The VFM is updated in the optimization process considering the cost of simulation models with different fidelity and the effects of the VFM uncertainty. A numerical example and an engineering case are used to demonstrate the applicability and efficiency of the proposed approach. The results show that the proposed approach can obtain Pareto solutions with high quality and it outperforms the other three existing approaches in terms of computational efficiency.


2021 ◽  
Vol 11 (11) ◽  
pp. 4716
Author(s):  
Pornpote Nusen ◽  
Wanarut Boonyung ◽  
Sunita Nusen ◽  
Kriengsak Panuwatwanich ◽  
Paskorn Champrasert ◽  
...  

Renovation is known to be a complicated type of construction project and prone to errors compared to new constructions. The need to carry out renovation work while keeping normal business activities running, coupled with strict governmental building renovation regulations, presents an important challenge affecting construction performance. Given the current availability of robust hardware and software, building information modeling (BIM) and optimization tools have become essential tools in improving construction planning, scheduling, and resource management. This study explored opportunities to develop a multi-objective genetic algorithm (MOGA) on existing BIM. The data were retrieved from a renovation project over the 2018–2020 period. Direct and indirect project costs, actual schedule, and resource usage were tracked and retrieved to create a BIM-based MOGA model. After 500 generations, optimal results were provided as a Pareto front with 70 combinations among total cost, time usage, and resource allocation. The BIM-MOGA can be used as an efficient tool for construction planning and scheduling using a combination of existing BIM along with MOGA into professional practices. This approach would help improve decision-making during the construction process based on the Pareto front data provided.


2016 ◽  
Vol 7 (1) ◽  
pp. 50-62 ◽  
Author(s):  
Bhabani Shankar Prasad Mishra ◽  
Subhashree Mishra ◽  
Sudhansu Sekhar Singh

The objective of this paper is to study the existing and current research on parallel multi-objective genetic algorithms (PMOGAs) through an intensive experiment. Many early efforts on parallelizing multi-objective genetic algorithms were introduced to reduce the processing time needed to reach an acceptable solution of them with various examples. Further, the authors tried to identify some of the issues that have not yet been studied systematically under the umbrella of parallel multi-objective genetic algorithms. Finally, some of the potential application of parallel multi objective genetic algorithm is discussed.


Sign in / Sign up

Export Citation Format

Share Document