Abstract
In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. This paper therefore presents a new constraint handling scheme. It adaptively defines an extended-feasible region that includes not only all feasible solutions, but some infeasible solutions near the boundary of the feasible region. Furthermore, we construct a new fitness function based on stochastic ranking, and meanwhile propose a new crossover operator that can produce more good individuals in general. Accordingly, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations show the efficiency of the proposed algorithm on four benchmark problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
