A New Asynchronous Parallel Evolutionary Algorithm for Function Optimization
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Dual Evolutionary Optimization
Selected Papers from the 5th European Conference on Artificial Evolution
International Journal of Systems Science
A line up evolutionary algorithm for solving nonlinear constrained optimization problems
Computers and Operations Research
Evolutionary algorithms for minimax problems in robust design
IEEE Transactions on Evolutionary Computation
A novel hybrid constraint handling technique for evolutionary optimization
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A hybrid cooperative search algorithm for constrained optimization
Structural and Multidisciplinary Optimization
A penalty-based evolutionary algorithm for constrained optimization
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
A new macroevolutionary algorithm for constrained optimization problems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Preference bi-objective evolutionary algorithm for constrained optimization
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Expert Systems with Applications: An International Journal
A differential evolution approach for solving constrained min-max optimization problems
Expert Systems with Applications: An International Journal
A genetic algorithm based augmented Lagrangian method for constrained optimization
Computational Optimization and Applications
| Hi-index | 0.00 |
This paper introduces a coevolutionary method developed for solving constrained optimization problems. This algorithm is based on the evolution of two populations with opposite objectives to solve saddle-point problems. The augmented Lagrangian approach is taken to transform a constrained optimization problem to a zero-sum game with the saddle point solution. The populations of the parameter vector and the multiplier vector approximate the zero-sum game by a static matrix game, in which the fitness of individuals is determined according to the security strategy of each population group. Selection, recombination, and mutation are done by using the evolutionary mechanism of conventional evolutionary algorithms such as evolution strategies, evolutionary programming, and genetic algorithms. Four benchmark problems are solved to demonstrate that the proposed coevolutionary method provides consistent solutions with better numerical accuracy than other evolutionary methods