Optimization of Vehicle-Borne Radar Antenna Pedestal Based on Modified NSGA-II

2014 ◽  
Vol 945-949 ◽  
pp. 2241-2247
Author(s):  
De Gao Zhao ◽  
Qiang Li
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Population Diversity ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Sorting Process ◽  
Definition Of ◽  
Radar Antenna ◽  
Modified Algorithm

This paper deals with application of Non-dominated Sorting Genetic Algorithm with elitism (NSGA-II) to solve multi-objective optimization problems of designing a vehicle-borne radar antenna pedestal. Five technical improvements are proposed due to the disadvantages of NSGA-II. They are as follow: (1) presenting a new method to calculate the fitness of individuals in population; (2) renewing the definition of crowding distance; (3) introducing a threshold for choosing elitist; (4) reducing some redundant sorting process; (5) developing a self-adaptive arithmetic cross and mutation probability. The modified algorithm can lead to better population diversity than the original NSGA-II. Simulation results prove rationality and validity of the modified NSGA-II. A uniformly distributed Pareto front can be obtained by using the modified NSGA-II. Finally, a multi-objective problem of designing a vehicle-borne radar antenna pedestal is settled with the modified algorithm.

scholarly journals Non-dominated sorting Harris’s hawk multi-objective optimizer based on reference point approach

2019 ◽  
Vol 15 (3) ◽  
pp. 1603 ◽  
Author(s):  
Shaymah Akram Yasear ◽  
Ku Ruhana Ku-Mahamud
Keyword(s):  
Reference Point ◽  
Pareto Front ◽  
Optimization Problems ◽  
Population Diversity ◽  
Experimental Results ◽  
Multi Objective Optimization ◽  
Next Generation ◽  
Multi Objective ◽  
Objective Space ◽  
Reference Point Approach

A non-dominated sorting Harris’s hawk multi-objective optimizer (NDSHHMO) algorithm is presented in this paper. The algorithm is able to improve the population diversity, convergence of non-dominated solutions toward the Pareto front, and prevent the population from trapping into local optimal. This was achieved by integrating fast non-dominated sorting with the original Harris’s hawk multi-objective optimizer (HHMO).  Non-dominated sorting divides the objective space into levels based on fitness values and then selects non-dominated solutions to produce the next generation of hawks. A set of well-known multi-objective optimization problems has been used to evaluate the performance of the proposed NDSHHMO algorithm. The results of the NDSHHMO algorithm were verified against the results of an HHMO algorithm. Experimental results demonstrate the efficiency of the proposed NDSHHMO algorithm in terms of enhancing the ability of convergence toward the Pareto front and significantly improve the search ability of the HHMO.

scholarly journals The dilemma between eliminating dominance-resistant solutions and preserving boundary solutions of extremely convex Pareto fronts

2021 ◽  
Author(s):  
Zhenkun Wang ◽  
Qingyan Li ◽  
Qite Yang ◽  
Hisao Ishibuchi
Keyword(s):  
Evolutionary Algorithms ◽  
Coping Strategies ◽  
Test Problem ◽  
Pareto Front ◽  
Optimization Problems ◽  
Feasible Region ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Fronts ◽  
Boundary Solutions

AbstractIt has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the $$\epsilon $$ ϵ -dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.

scholarly journals Multi-objective optimization of solar thermal photovoltaic hybrid power generation system based on NSGA-II algorithm

2021 ◽  
Vol 336 ◽  
pp. 02022
Author(s):  
Liang Meng ◽  
Wen Zhou ◽  
Yang Li ◽  
Zhibin Liu ◽  
Yajing Liu
Keyword(s):  
Power Generation ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Solar Thermal ◽  
Multi Objective Optimization ◽  
Generation System ◽  
Nsga Ii ◽  
Multi Objective ◽  
Hybrid Power ◽  
Power Generation System

In this paper, NSGA-Ⅱ is used to realize the dual-objective optimization and three-objective optimization of the solar-thermal photovoltaic hybrid power generation system; Compared with the optimal solution set of three-objective optimization, optimization based on technical and economic evaluation indicators belongs to the category of multi-objective optimization. It can be considered that NSGA-Ⅱ is very suitable for multi-objective optimization of solar-thermal photovoltaic hybrid power generation system and other similar multi-objective optimization problems.

Toward the Use of Pareto Performance Solutions and Pareto Robustness Solutions for Multi-Objective Robust Optimization Problems

2012 ◽  
Author(s):  
Weijun Wang ◽  
Stéphane Caro ◽  
Fouad Bennis ◽  
Oscar Brito Augusto
Keyword(s):  
Robust Optimization ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Robust Solutions ◽  
Multi Objective ◽  
Robust Optimization Problem ◽  
Design Solutions ◽  
Further Development

For Multi-Objective Robust Optimization Problem (MOROP), it is important to obtain design solutions that are both optimal and robust. To find these solutions, usually, the designer need to set a threshold of the variation of Performance Functions (PFs) before optimization, or add the effects of uncertainties on the original PFs to generate a new Pareto robust front. In this paper, we divide a MOROP into two Multi-Objective Optimization Problems (MOOPs). One is the original MOOP, another one is that we take the Robustness Functions (RFs), robust counterparts of the original PFs, as optimization objectives. After solving these two MOOPs separately, two sets of solutions come out, namely the Pareto Performance Solutions (PP) and the Pareto Robustness Solutions (PR). Make a further development on these two sets, we can get two types of solutions, namely the Pareto Robustness Solutions among the Pareto Performance Solutions (PR(PP)), and the Pareto Performance Solutions among the Pareto Robustness Solutions (PP(PR)). Further more, the intersection of PR(PP) and PP(PR) can represent the intersection of PR and PP well. Then the designer can choose good solutions by comparing the results of PR(PP) and PP(PR). Thanks to this method, we can find out the optimal and robust solutions without setting the threshold of the variation of PFs nor losing the initial Pareto front. Finally, an illustrative example highlights the contributions of the paper.

A Strength Pareto Gravitational Search Algorithm for Multi-Objective Optimization Problems

2015 ◽  
Vol 29 (06) ◽  
pp. 1559010 ◽  
Author(s):  
Xiaohui Yuan ◽  
Zhihuan Chen ◽  
Yanbin Yuan ◽  
Yuehua Huang ◽  
Xiaopan Zhang
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Local Optima ◽  
Multi Objective ◽  
Fine Grained ◽  
Gravitational Search

A novel strength Pareto gravitational search algorithm (SPGSA) is proposed to solve multi-objective optimization problems. This SPGSA algorithm utilizes the strength Pareto concept to assign the fitness values for agents and uses a fine-grained elitism selection mechanism to keep the population diversity. Furthermore, the recombination operators are modeled in this approach to decrease the possibility of trapping in local optima. Experiments are conducted on a series of benchmark problems that are characterized by difficulties in local optimality, nonuniformity, and nonconvexity. The results show that the proposed SPGSA algorithm performs better in comparison with other related works. On the other hand, the effectiveness of two subtle means added to the GSA are verified, i.e. the fine-grained elitism selection and the use of SBX and PMO operators. Simulation results show that these measures not only improve the convergence ability of original GSA, but also preserve the population diversity adequately, which enables the SPGSA algorithm to have an excellent ability that keeps a desirable balance between the exploitation and exploration so as to accelerate the convergence speed to the true Pareto-optimal front.

scholarly journals An Effective Couple Method for Reliability-Based Multi-Objective Optimization of Truss Structures with Static and Dynamic Constraints

2019 ◽  
Vol 17 (06) ◽  
pp. 1950016 ◽  
Author(s):  
T. Vo-Duy ◽  
D. Duong-Gia ◽  
V. Ho-Huu ◽  
T. Nguyen-Thoi
Keyword(s):  
Cross Section ◽  
Optimization Problems ◽  
Computational Cost ◽  
Probabilistic Constraints ◽  
Truss Structures ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Dynamic Constraints ◽  
Multi Objective ◽  
Couple Method

This paper proposes an effective couple method for solving reliability-based multi-objective optimization problems of truss structures with static and dynamic constraints. The proposed coupling method integrates a single-loop deterministic method (SLDM) into the nondominated sorting genetic algorithm II (NSGA-II) algorithm to give the so-called SLDM-NSGA-II. Thanks to the advantage of SLDM, the probabilistic constraints are treated as approximating deterministic constraints. And therefore the reliability-based multi-objective optimization problems can be transformed into the deterministic multi-objective optimization problems of which the computational cost is reduced significantly. In these reliability-based multi-objective optimization problems, the conflicting objective functions are to minimize the weight and the displacements of the truss. The design variables are cross-section areas of the bars and contraints include static and dynamic constraints. For reliability analysis, the effect of uncertainty of parameters such as force, added mass in the nodes, material properties and cross-section areas of the bars are taken into account. The effectiveness and reliability of the proposed method are demonstrated through three benchmark-type truss structures including a 10-bar planar truss, a 72-bar spatial truss and a 200-bar planar truss. Moreover, the influence of parameters on the reliability-based Pareto optimal fronts is also carried out.

Expected-Improvement-Based Methods for Adaptive Sampling in Multi-Objective Optimization Problems

2016 ◽  
Author(s):  
Jesper Kristensen ◽  
You Ling ◽  
Isaac Asher ◽  
Liping Wang
Keyword(s):  
Convex Hull ◽  
Design Optimization ◽  
Adaptive Sampling ◽  
Pareto Front ◽  
Performance Metrics ◽  
Sampling Methods ◽  
Optimization Problems ◽  
Expected Improvement ◽  
Multi Objective Optimization ◽  
Multi Objective

Adaptive sampling methods have been used to build accurate meta-models across large design spaces from which engineers can explore data trends, investigate optimal designs, study the sensitivity of objectives on the modeling design features, etc. For global design optimization applications, adaptive sampling methods need to be extended to sample more efficiently near the optimal domains of the design space (i.e., the Pareto front/frontier in multi-objective optimization). Expected Improvement (EI) methods have been shown to be efficient to solve design optimization problems using meta-models by incorporating prediction uncertainty. In this paper, a set of state-of-the-art methods (hypervolume EI method and centroid EI method) are presented and implemented for selecting sampling points for multi-objective optimizations. The classical hypervolume EI method uses hyperrectangles to represent the Pareto front, which shows undesirable behavior at the tails of the Pareto front. This issue is addressed utilizing the concepts from physical programming to shape the Pareto front. The modified hypervolume EI method can be extended to increase local Pareto front accuracy in any area identified by an engineer, and this method can be applied to Pareto frontiers of any shape. A novel hypervolume EI method is also developed that does not rely on the assumption of hyperrectangles, but instead assumes the Pareto frontier can be represented by a convex hull. The method exploits fast methods for convex hull construction and numerical integration, and results in a Pareto front shape that is desired in many practical applications. Various performance metrics are defined in order to quantitatively compare and discuss all methods applied to a particular 2D optimization problem from the literature. The modified hypervolume EI methods lead to dramatic resource savings while improving the predictive capabilities near the optimal objective values.

scholarly journals Multi-objective optimization of retaining wall using genetic algorithm

2021 ◽  
Vol 8 (1-2) ◽  
pp. 58-65
Author(s):  
Filip Dodigović ◽  
Krešo Ivandić ◽  
Jasmin Jug ◽  
Krešimir Agnezović
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Retaining Wall ◽  
Silty Sand ◽  
Embedment Depth ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Definition Of ◽  
The Cost

The paper investigates the possibility of applying the genetic algorithm NSGA-II to optimize a reinforced concrete retaining wall embedded in saturated silty sand. Multi-objective constrained optimization was performed to minimize the cost, while maximizing the overdesign factors (ODF) against sliding, overturning, and soil bearing resistance. For a given change in ground elevation of 5.0 m, the width of the foundation and the embedment depth were optimized. Comparing the algorithm's performance in the cases of two-objective and three objective optimizations showed that the number of objectives significantly affects its convergence rate. It was also found that the verification of the wall against the sliding yields a lower ODF value than verifications against overturning and soil bearing capacity. Because of that, it is possible to exclude them from the definition of optimization problem. The application of the NSGA-II algorithm has been demonstrated to be an effective tool for determining the set of optimal retaining wall designs.

Multi-objective optimization of a hybrid electromagnetic suspension system for ride comfort, road holding and regenerated power

2016 ◽  
Vol 23 (5) ◽  
pp. 782-793 ◽  
Author(s):  
Mansour Ataei ◽  
Ehsan Asadi ◽  
Avesta Goodarzi ◽  
Amir Khajepour ◽  
Mir Behrad Khamesee
Keyword(s):  
Pareto Front ◽  
Ride Comfort ◽  
Optimization Method ◽  
Suspension System ◽  
Multi Objective Optimization ◽  
Damping Force ◽  
Nsga Ii ◽  
Electromagnetic Suspension ◽  
Multi Objective ◽  
Electromagnetic Component

This paper reports work on the optimization and performance evaluation of a hybrid electromagnetic suspension system equipped with a hybrid electromagnetic damper. The hybrid damper is configured to operate with hydraulic and electromagnetic components. The hydraulic component produces a large fail-safe baseline damping force, while the electromagnetic component adds energy regeneration and adaptability to the suspension. For analyzing the system, the electromagnetic component was modeled and integrated into a 2DOF quarter-car model. Three criteria were considered for evaluating the performance of the suspension system: ride comfort, road holding and regenerated power. Using the genetic algorithm multi-objective optimization (NSGA-II), the suspension design was optimized to improve the performance of the vehicle with respect to the selected criteria. The multi-objective optimization method provided a set of solutions called Pareto front in which all solutions are equally good and the selection of each one depends on conditions and needs. Among the given solutions in the Pareto front, a small number of cases, with different design purposes, were selected. The performances of the selected designs were compared with two reference systems: a conventional and a nonoptimized hybrid suspension system. The results show that the ride comfort and road holding qualities of the optimized hybrid system are improved, and the regenerated power is considerably increased.

Sign in / Sign up

Export Citation Format

Share Document