Solving Nonlinear Constrained Optimization Problems by the ε Constrained Differential Evolution
Solving Nonlinear Constrained Optimization Problems by the ε Constrained Differential Evolution
复制标题
DOI：
10.1109/icsmc.2006.385209
复制
发表时间：
2006-10
期刊：
影响因子：
--
通讯作者：
T. Takahama;S. Sakai;N. Iwane
中科院分区：
文献类型：
--
作者：
T. Takahama;S. Sakai;N. Iwane
ε约束方法是一种算法转换方法，它可以使用基于搜索点违反约束的情况来比较搜索点的ε级别比较，将无约束问题的算法转换为约束问题的算法。我们提出了ε约束差分进化εDE，它是ε约束方法和差分进化（DE）的结合。 DE是一种简单、快速、稳定的搜索算法，对多模态问题具有鲁棒性。预计 εDE 对于多模态问题具有鲁棒性，可以运行得非常快，并且可以找到非常高质量的解决方案。通过将 εDE 与众所周知的非线性约束问题的各种方法进行比较，显示了 εDE 的有效性。
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.