BIEA: a novel evolutionary algorithm for nonlinear constrained programming

Authors:
Liping Jia;Guocheng Zou;Chi Luo;Jin Zou
Affiliations:
College of mathematics and infonnation science, Leshan nonnal university, Leshan, China;College of mathematics and infonnation science, Leshan nonnal university, Leshan, China;College of mathematics and infonnation science, Leshan nonnal university, Leshan, China;College of mathematics and infonnation science, Leshan nonnal university, Leshan, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2
Year:
2010

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Differential evolution with dynamic stochastic selection for constrained optimization

Information Sciences: an International Journal
Preference bi-objective evolutionary algorithm for constrained optimization

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonlinear constrained problem has been deemed as a hard problem. This paper proposes a kind of evolutionary algorithm for constrained programming. The constrained conditions are converted into an objective and then the constrained programming is transformed into a special bi-objective unconstrained problem. The Pareto concept of multiobjective programming is introduced, then crossover operator using uniform designing method and feasible mutation operator are designed to solve this kind of bi-objective unconstrained programming. The detailed procedure of the algorithm based on two objectives is proposed. Five standard benchmarks are applied to verify the validity of the algorithm. The feasibility and efficiency of the proposed algorithm are shown by comparing with other two algorithms.