An Efficient Non-dominated Sorting Method for Evolutionary Algorithms

2008 ◽  
Vol 16 (3) ◽  
pp. 355-384 ◽  
Author(s):  
Hongbing Fang ◽  
Qian Wang ◽  
Yi-Cheng Tu ◽  
Mark F. Horstemeyer
Keyword(s):  
Evolutionary Algorithms ◽  
Divide And Conquer ◽  
Computational Time ◽  
Sorting Algorithm ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Overall Efficiency ◽  
Dominance Tree ◽  
The Cost

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN2) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-dominated fronts takes the majority of total computational time (excluding the cost of fitness evaluations) of NSGA-II, making this algorithm faster will significantly improve the overall efficiency of NSGA-II and other genetic algorithms using non-dominated sorting. The new non-dominated sorting algorithm proposed in this study reduces the number of redundant comparisons existing in the algorithm of NSGA-II by recording the dominance information among solutions from their first comparisons. By utilizing a new data structure called the dominance tree and the divide-and-conquer mechanism, the new algorithm is faster than NSGA-II for different numbers of objective functions. Although the number of solution comparisons by the proposed algorithm is close to that of NSGA-II when the number of objectives becomes large, the total computational time shows that the proposed algorithm still has better efficiency because of the adoption of the dominance tree structure and the divide-and-conquer mechanism.

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting

2018 ◽  
Vol 26 (1) ◽  
pp. 89-116 ◽  
Author(s):  
Patrik Gustavsson ◽  
Anna Syberfeldt
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Large Population ◽  
Divide And Conquer ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Sorting Algorithms ◽  
Population Sizes ◽  
Speed Up

Non-dominated sorting is a technique often used in evolutionary algorithms to determine the quality of solutions in a population. The most common algorithm is the Fast Non-dominated Sort (FNS). This algorithm, however, has the drawback that its performance deteriorates when the population size grows. The same drawback applies also to other non-dominating sorting algorithms such as the Efficient Non-dominated Sort with Binary Strategy (ENS-BS). An algorithm suggested to overcome this drawback is the Divide-and-Conquer Non-dominated Sort (DCNS) which works well on a limited number of objectives but deteriorates when the number of objectives grows. This article presents a new, more efficient algorithm called the Efficient Non-dominated Sort with Non-Dominated Tree (ENS-NDT). ENS-NDT is an extension of the ENS-BS algorithm and uses a novel Non-Dominated Tree (NDTree) to speed up the non-dominated sorting. ENS-NDT is able to handle large population sizes and a large number of objectives more efficiently than existing algorithms for non-dominated sorting. In the article, it is shown that with ENS-NDT the runtime of multi-objective optimization algorithms such as the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) can be substantially reduced.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

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.

Design of Optimal Operational Parameters for Steam-Alternating-Solvent Processes in Heterogeneous Reservoirs - A Multi-Objective Optimization Approach

2021 ◽  
Author(s):  
Israel Mayo-Molina ◽  
Juliana Y. Leung
Keyword(s):  
Sensitivity Analysis ◽  
Computational Time ◽  
Optimization Approach ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Operational Parameters ◽  
Multi Objective ◽  
Bottom Hole ◽  
Decision Variables ◽  
Conflicting Objectives

Abstract The Steam Alternating Solvent (SAS) process has been proposed and studied in recent years as a new auspicious alternative to the conventional thermal (steam-based) bitumen recovery process. The SAS process incorporates steam and solvent (e.g. propane) cycles injected alternatively using the same configuration as the Steam-Assisted Gravity-Drainage (SAGD) process. The SAS process offers many advantages, including lower capital and operational cost, as well as a reduction in water usage and lower Greenhouse Gas (GHG) Emissions. On the other hand, one of the main challenges of this relatively new process is the influence of uncertain reservoir heterogeneity distribution, such as shale barriers, on production behaviour. Many complex physical mechanisms, including heat transfer, fluid flows, and mass transfer, must be coupled. A proper design and selection of the operational parameters must consider several conflicting objectives. This work aims to develop a hybrid multi-objective optimization (MOO) framework for determining a set of Pareto-optimal SAS operational parameters under a variety of heterogeneity scenarios. First, a 2-D homogeneous reservoir model is constructed based on typical Cold lake reservoir properties in Alberta, Canada. The homogeneous model is used to establish a base scenario. Second, different shale barrier configurations with varying proportions, lengths, and locations are incorporated. Third, a detailed sensitivity analysis is performed to determine the most impactful parameters or decision variables. Based on the results of the sensitivity analysis, several objective functions are formulated (e.g., minimizing energy and solvent usage). Fourth, Response Surface Methodology (RSM) is applied to generate a set of proxy models to approximate the non-linear relationship between the decision variables and the objective functions and to reduce the overall computational time. Finally, three Multi-Objective Evolutionary Algorithms (MOEAs) are applied to search and compare the optimal sets of decision parameters. The study showed that the SAS process is sensitive to the shale barrier distribution, and that impact is strongly dependent on the location and length of a specific shale barrier. When a shale barrier is located near the injector well, pressure and temperature may build up in the near-well area, preventing additional steam and solvent be injected and, consequently, reducing the oil production. Operational constraints, such as bottom-hole pressure, steam trap criterion, and bottom-hole gas rate in the producer, are among various critical decision variables examined in this study. A key conclusion is that the optimal operating strategy should depend on the underlying heterogeneity. Although this notion has been alluded to in other previous steam- or solvent-based studies, this paper is the first to utilize a MOO framework for systematically determining a specific optimal strategy for each heterogeneity scenario. With the advancement of continuous downhole fibre-optic monitoring, the outcomes can potentially be integrated into other real-time reservoir characterization and optimization work-flows.

Multi-Objective Optimization of Manufacturing Processes Using Evolutionary Algorithms

2012 ◽  
pp. 44-66
Author(s):  
M. Kanthababu
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Multiple Objectives ◽  
Manufacturing Processes ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Local Optima ◽  
Multi Objective ◽  
Research Areas

Recently evolutionary algorithms have created more interest among researchers and manufacturing engineers for solving multiple-objective problems. The objective of this chapter is to give readers a comprehensive understanding and also to give a better insight into the applications of solving multi-objective problems using evolutionary algorithms for manufacturing processes. The most important feature of evolutionary algorithms is that it can successfully find globally optimal solutions without getting restricted to local optima. This chapter introduces the reader with the basic concepts of single-objective optimization, multi-objective optimization, as well as evolutionary algorithms, and also gives an overview of its salient features. Some of the evolutionary algorithms widely used by researchers for solving multiple objectives have been presented and compared. Among the evolutionary algorithms, the Non-dominated Sorting Genetic Algorithm (NSGA) and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) have emerged as most efficient algorithms for solving multi-objective problems in manufacturing processes. The NSGA method applied to a complex manufacturing process, namely plateau honing process, considering multiple objectives, has been detailed with a case study. The chapter concludes by suggesting implementation of evolutionary algorithms in different research areas which hold promise for future applications.

Multi-Objective Evolutionary Algorithms

2016 ◽  
pp. 301-345
Author(s):  
A. K. Nandi ◽  
K. Deb
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Optimization Problem ◽  
Performance Metrics ◽  
Research Work ◽  
Primary Objective ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Mould Material ◽  
Multi Objective

The primary objective in designing appropriate particle reinforced polyurethane composite which will be used as a mould material in soft tooling process is to minimize the cycle time of soft tooling process by providing faster cooling rate during solidification of wax/plastic component. This chapter exemplifies an effective approach to design particle reinforced mould materials by solving the inherent multi-objective optimization problem associated with soft tooling process using evolutionary algorithms. In this chapter, first a brief introduction of multi-objective optimization problem with the key issues is presented. Then, after a short overview on the working procedure of genetic algorithm, a well- established multi-objective evolutionary algorithm, namely NSGA-II along with various performance metrics are described. The inherent multi-objective problem in soft tooling process is demonstrated and subsequently solved using an elitist non-dominated sorting genetic algorithm, NSGA-II. Multi-objective optimization results obtained using NSGA-II are analyzed statistically and validated with real industrial application. Finally the fundamental results of this approach are summarized and various perspectives to the industries along with scopes for future research work are pointed out.

scholarly journals An Improved Nondominated Sorting Genetic Algorithm III Method for Solving Multiobjective Weapon-Target Assignment Part I: The Value of Fighter Combat

2018 ◽  
Vol 2018 ◽  
pp. 1-23 ◽  
Author(s):  
You Li ◽  
Yingxin Kou ◽  
Zhanwu Li
Keyword(s):  
Reference Points ◽  
Sorting Algorithm ◽  
Nsga Ii ◽  
Target Assignment ◽  
Objective Model ◽  
Typical Instance ◽  
Attack And Defense ◽  
Battlefield Environment ◽  
The Cost ◽  
Nondominated Sorting

Multiobjective weapon-target assignment is a type of NP-complete problem, and the reasonable assignment of weapons is beneficial to attack and defense. In order to simulate a real battlefield environment, we introduce a new objective—the value of fighter combat on the basis of the original two-objective model. The new three-objective model includes maximizing the expected damage of the enemy, minimizing the cost of missiles, and maximizing the value of fighter combat. To solve the problem with complex constraints, an improved nondominated sorting algorithm III is proposed in this paper. In the proposed algorithm, a series of reference points with good performances in convergence and distribution are continuously generated according to the current population to guide the evolution; otherwise, useless reference points are eliminated. Moreover, an online operator selection mechanism is incorporated into the NSGA-III framework to autonomously select the most suitable operator while solving the problem. Finally, the proposed algorithm is applied to a typical instance and compared with other algorithms to verify its feasibility and effectiveness. Simulation results show that the proposed algorithm is successfully applied to the multiobjective weapon-target assignment problem, which effectively improves the performance of the traditional NSGA-III and can produce better solutions than the two multiobjective optimization algorithms NSGA-II and MPACO.

Multi-Objective Optimization with Estimation of Distribution Algorithm in a Noisy Environment

2013 ◽  
Vol 21 (1) ◽  
pp. 149-177 ◽  
Author(s):  
Vui Ann Shim ◽  
Kay Chen Tan ◽  
Jun Yong Chia ◽  
Abdullah Al Mamun
Keyword(s):  
Optimization Problems ◽  
Estimation Of Distribution Algorithm ◽  
Computational Time ◽  
Decision Variable ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Noisy Environment ◽  
Multi Objective ◽  
Noisy Information ◽  
Estimation Of Distribution

Many real-world optimization problems are subjected to uncertainties that may be characterized by the presence of noise in the objective functions. The estimation of distribution algorithm (EDA), which models the global distribution of the population for searching tasks, is one of the evolutionary computation techniques that deals with noisy information. This paper studies the potential of EDAs; particularly an EDA based on restricted Boltzmann machines that handles multi-objective optimization problems in a noisy environment. Noise is introduced to the objective functions in the form of a Gaussian distribution. In order to reduce the detrimental effect of noise, a likelihood correction feature is proposed to tune the marginal probability distribution of each decision variable. The EDA is subsequently hybridized with a particle swarm optimization algorithm in a discrete domain to improve its search ability. The effectiveness of the proposed algorithm is examined via eight benchmark instances with different characteristics and shapes of the Pareto optimal front. The scalability, hybridization, and computational time are rigorously studied. Comparative studies show that the proposed approach outperforms other state of the art algorithms.

scholarly journals MULTI-OBJECTIVE OPTIMIZATION OF REINFORCED CONCRETE FRAMES USING NSGA-II ALGORITHM

2016 ◽  
Vol 8 (4) ◽  
pp. 157-164 ◽  
Author(s):  
Mehdi Babaei ◽  
Masoud Mollayi
Keyword(s):  
Genetic Algorithm ◽  
Reinforced Concrete ◽  
Steel Structures ◽  
American Concrete Institute ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Design Variables ◽  
Pareto Fronts

In recent decades, the use of genetic algorithm (GA) for optimization of structures has been highly attractive in the study of concrete and steel structures aiming at weight optimization. However, it has been challenging for multi-objective optimization to determine the trade-off between objective functions and to obtain the Pareto-front for reinforced concrete (RC) and steel structures. Among different methods introduced for multi-objective optimization based on genetic algorithms, Non-Dominated Sorting Genetic Algorithm II (NSGA II) is one of the most popular algorithms. In this paper, multi-objective optimization of RC moment resisting frame structures considering two objective functions of cost and displacement are introduced and examined. Three design models are optimized using the NSGA-II algorithm. Evaluation of optimal solutions and the algorithm process are discussed in details. Sections of beams and columns are considered as design variables and the specifications of the American Concrete Institute (ACI) are employed as the design constraints. Pareto-fronts for the objective space have been obtained for RC frame models of four, eight and twelve floors. The results indicate smooth Pareto-fronts and prove the speed and accuracy of the method.

Multi-objective design optimization of hybrid renewable systems using UGF

2015 ◽  
Vol 34 (6) ◽  
pp. 1825-1844 ◽  
Author(s):  
Carmen Delgado ◽  
José Antonio Domínguez-Navarro
Keyword(s):  
State Model ◽  
Computational Time ◽  
Renewable Generation ◽  
Multi Objective Optimization ◽  
Generation System ◽  
Hybrid Generation ◽  
Content Type ◽  
Multi Objective ◽  
The Cost ◽  
The Impact

Purpose – Renewable generation is a main component of most hybrid generation systems. However, randomness on its generation is a characteristic to be considered due to its direct impact on reliability and performance of these systems. For this reason, renewable generation usually is accompanied with other generation elements to improve their general performance. The purpose of this paper is to analyze the power generation system, composed of solar, wind and diesel generation and power outsourcing option from the grid as means of reserve source. A multi-objective optimization for the design of hybrid generation system is proposed, particularly using the cost of energy, two different reliability indexes and the percentage of renewable energy as objectives. Further, the uncertainty of renewable sources and demand is modeled with a new technique that permits to evaluate the reliability quickly. Design/methodology/approach – The multi-state model of the generators and the load is modeled with the Universal Generating Function (UGF) to estimate the reliability indexes for the whole system. Then an evolutionary algorithm NSGA-II (Non-dominated Sorting Genetic Algorithm) is used to solve the multi-objective optimization model. Findings – The use of UGF methodology reduces the computation time, providing effective results. The validation of reliability assessment of hybrid generation systems using the UGF is carried out taking as a benchmark the results obtained with the Monte Carlo simulation. The proposed multi-objective algorithm gives as a result different generators combinations that outline hybrid systems, where some of them could be preferred over others depending on its results for each independent objective. Also it allows us to observe the changes produced on the resulting solutions due to the impact of the power fluctuation of the renewable generators. Originality/value – The main contributions of this paper are: an extended multi state model that includes different types of renewable energies, with emphasis on modeling of solar energy; demonstrate the performance improvement of UGF against SMC regarding the computational time required for this case; test the impact of different multi-states numbers for the representation of the elements; depict through multi-objective optimization, the impact of combining different energies on the cost and reliability of the resultant systems.

Sign in / Sign up

Export Citation Format

Share Document