Abstract
In this paper, we explore the capabilities of different types of evolution strategies (ES) to solve global optimization problems with constraints. The aim is to highlight the idea that the selection of the search engine is more critical than the selection of the constraint-handling mechanism, which can be very simple indeed. We show how using just three simple comparison criteria based on feasibility, the simple evolution strategy can be led to the feasible region of the search space and find the global optimum solution (or a very good approximation of it). Different ES including a variation of a (μ+1) − ES and with or without correlated mutation were implemented. Such approaches were tested using a well-known test suite for constrained optimization. Furthermore, the most competitive version found (among those five) was compared against three state-of-the-art approaches and it was also compared against a GA using the same constraint-handling approach. Finally, our evolution strategy was used to solve some engineering design problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.