Abstract
The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the ε level comparison that compares search points based on the constraint violation of them. We propose the ε constrained differential evolution εDE, which is the combination of the ε constrained method and differential evolution (DE). DE is a simple, fast and stable search algorithm that is robust to multi-modal problems. It is expected that the εDE is robust to multi-modal problems, can run very fast and can find very high quality solutions. The effectiveness of the εDE is shown by comparing it with various methods on well known nonlinear constrained 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 call
