Proceedings Article10.1109/CEC.2011.5949709
Differential evolution combined with constraint consensus for constrained optimization
Noha M. Hamza,Saber M. Elsayed,Daryl Essam,Ruhul A. Sarker +3 more
- 05 Jun 2011
- pp 865-872
14
TL;DR: This paper introduces a Constraint Consensus (CC) method within the Differential Evolution (DE) algorithm for solving COPs, and shows that the solutions are competitive, if not better, as compared to the state of the art algorithms.
read more
Abstract: Solving a Constrained Optimization Problem (COP) is much more challenging than its unconstrained counterpart. In solving COPs, the feasibility of a solution is a prime condition that requires the conversion of one or more infeasible individuals to feasible individuals. In this paper, to encourage the effective movement of infeasible individuals towards a feasible region, we introduce a Constraint Consensus (CC) method within the Differential Evolution (DE) algorithm for solving COPs. The algorithm has been tested by solving 13 well-known benchmark problems. The experimental results show that the solutions are competitive, if not better, as compared to the state of the art algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Constraint-Handling in Nature-Inspired Numerical Optimization: Past, Present and Future
TL;DR: An analysis of the most relevant types of constraint-handling techniques that have been adopted with nature-inspired algorithms and the most popular approaches are analyzed in more detail.
1K
Constraint-handling in nature-inspired numerical optimization: Past, present and future
TL;DR: An analysis of the most relevant types of constraint-handling techniques that have been adopted with nature-inspired algorithms and the most popular approaches are analyzed in more detail.
213
Constraint Consensus Mutation-Based Differential Evolution for Constrained Optimization
TL;DR: This paper introduces a new DE mutation operator that incorporates a mechanism, based on constraint consensus, that can directly help to reduce the constraint violations during the evolutionary search process.
67
A constraint consensus memetic algorithm for solving constrained optimization problems
TL;DR: A genetic algorithm is combined with a class of search methods, known as constraint consensus methods, that assist infeasible individuals to move towards the feasible region that shows superior performance over other algorithms.
23
Differential evolution with multi-constraint consensus methods for constrained optimization
TL;DR: This research introduces different variants of the Differential Evolution algorithm, with multiple constraint consensus methods for solving constrained optimization problems, and compares them among themselves and with other state of the art algorithms.
13
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.