Constrained Optimization with Evolutionary Algorithms: A Comprehensive Review

Global optimization is an essential part of any kind of system. Various algorithms have been proposed that try to imitate the learning and problem solving abilities of the nature up to certain level. The main idea of all nature-inspired algorithms is to generate an interconnected network of individuals, a population. Although most of unconstrained optimization problems can be easily handled with Evolutionary Algorithms (EA), constrained optimization problems (COPs) are very complex. In this paper, a comprehensive literature review will be presented which summarizes the constraint handling techniques for COP

Multi-Objective Optimization of Planetary Gearbox with Adaptive Hybrid Particle Swarm Differential Evolution Algorithm

This paper considers the problem of constrained multi-objective non-linear optimization of planetary gearbox based on hybrid metaheuristic algorithm. Optimal design of planetary gear trains requires simultaneous minimization of multiple conflicting objectives, such as gearbox volume, center distance, contact ratio, power loss, etc. In this regard, the theoretical formulation and numerical procedure for the calculation of the planetary gearbox power efficiency has been developed. To successfully solve the stated constrained multi-objective optimization problem, in this paper a hybrid algorithm between particle swarm optimization and differential evolution algorithms has been proposed and applied to considered problem. Here, the mutation operators from the differential evolution algorithm have been incorporated into the velocity update equation of the particle swarm optimization algorithm, with the adaptive population spacing parameter employed to select the appropriate mutation operator for the current optimization condition. It has been shown that the proposed algorithm successfully obtains the solutions of the non-convex Pareto set, and reveals key insights in reducing the weight, improving efficiency and preventing premature failure of gears. Compared to other well-known algorithms, the numerical simulation results indicate that the proposed algorithm shows improved optimization performance in terms of the quality of the obtained Pareto solutions

Multi-Objective Optimization of Planetary Gearbox with Adaptive Hybrid Particle Swarm Differential Evolution Algorithm

This paper considers the problem of constrained multi-objective non-linear optimization of planetary gearbox based on hybrid metaheuristic algorithm. Optimal design of planetary gear trains requires simultaneous minimization of multiple conflicting objectives, such as gearbox volume, center distance, contact ratio, power loss, etc. In this regard, the theoretical formulation and numerical procedure for the calculation of the planetary gearbox power efficiency has been developed. To successfully solve the stated constrained multi-objective optimization problem, in this paper a hybrid algorithm between particle swarm optimization and differential evolution algorithms has been proposed and applied to considered problem. Here, the mutation operators from the differential evolution algorithm have been incorporated into the velocity update equation of the particle swarm optimization algorithm, with the adaptive population spacing parameter employed to select the appropriate mutation operator for the current optimization condition. It has been shown that the proposed algorithm successfully obtains the solutions of the non-convex Pareto set, and reveals key insights in reducing the weight, improving efficiency and preventing premature failure of gears. Compared to other well-known algorithms, the numerical simulation results indicate that the proposed algorithm shows improved optimization performance in terms of the quality of the obtained Pareto solutions

Process Knowledge-guided Autonomous Evolutionary Optimization for Constrained Multiobjective Problems

Various real-world problems can be attributed to constrained multi-objective optimization problems. Although there are various solution methods, it is still very challenging to automatically select efficient solving strategies for constrained multi-objective optimization problems. Given this, a process knowledge-guided constrained multi-objective autonomous evolutionary optimization method is proposed. Firstly, the effects of different solving strategies on population states are evaluated in the early evolutionary stage. Then, the mapping model of population states and solving strategies is established. Finally, the model recommends subsequent solving strategies based on the current population state. This method can be embedded into existing evolutionary algorithms, which can improve their performances to different degrees. The proposed method is applied to 41 benchmarks and 30 dispatch optimization problems of the integrated coal mine energy system. Experimental results verify the effectiveness and superiority of the proposed method in solving constrained multi-objective optimization problems.The National Key R&D Program of China, the National Natural Science Foundation of China, Shandong Provincial Natural Science Foundation, Fundamental Research Funds for the Central Universities and the Open Research Project of The Hubei Key Laboratory of Intelligent Geo-Information Processing.http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235hj2023Electrical, Electronic and Computer Engineerin

A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms

This is the author accepted manuscript. The final version is available from Springer Verlag via the DOI in this record.Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approximation-based algorithms. We also compare these algorithms based on different criteria such as metamodeling technique and evolutionary algorithm used, type and dimensions of the problem solved, handling constraints, training time and the type of evolution control. Furthermore, we identify and discuss some promising elements and major issues among algorithms in the literature related to using an approximation and numerical settings used. In addition, we discuss selecting an algorithm to solve a given computationally expensive multiobjective optimization problem based on the dimensions in both objective and decision spaces and the computation budget available.The research of Tinkle Chugh was funded by the COMAS Doctoral Program (at the University of Jyväskylä) and FiDiPro Project DeCoMo (funded by Tekes, the Finnish Funding Agency for Innovation), and the research of Dr. Karthik Sindhya was funded by SIMPRO project funded by Tekes as well as DeCoMo

A new hybrid evolutionary algorithm for the treatment of equality constrained MOPs

Multi-objective evolutionary algorithms are widely used by researchers and practitioners to solve multi-objective optimization problems (MOPs), since they require minimal assumptions and are capable of computing a finite size approximation of the entire solution set in one run of the algorithm. So far, however, the adequate treatment of equality constraints has played a minor role. Equality constraints are particular since they typically reduce the dimension of the search space, which causes problems for stochastic search algorithms such as evolutionary strategies. In this paper, we show that multi-objective evolutionary algorithms hybridized with continuation-like techniques lead to fast and reliable numerical solvers. For this, we first propose three new problems with different characteristics that are indeed hard to solve by evolutionary algorithms. Next, we develop a variant of NSGA-II with a continuation method. We present numerical results on several equality-constrained MOPs to show that the resulting method is highly competitive to state-of-the-art evolutionary algorithms.Peer ReviewedPostprint (published version

Assessment of water resources management strategy under different evolutionary optimization techniques

Competitive optimization techniques have been developed to address the complexity of integrated water resources management (IWRM) modelling; however, model adaptation due to changing environments is still a challenge. In this paper we employ multi-variable techniques to increase confidence in model-driven decision-making scenarios. Here, water reservoir management was assessed using two evolutionary algorithm (EA) techniques, the epsilon-dominance-driven self-adaptive evolutionary algorithm (∈-DSEA) and the Borg multi-objective evolutionary algorithm (MOEA). Many objective scenarios were evaluated to manage flood risk, hydropower generation, water supply, and release sequences over three decades. Computationally, the ∈-DSEA's results are generally reliable, robust, effective and efficient when compared directly with the Borg MOEA but both provide decision support model outputs of value