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