返回
A benchmark for equality constrained multi-objective optimization
DOI:10.1016/j.swevo.2019.100619.png)
摘要
En 中文
Evolutionary multi-objective optimization (EMO) is certainly a story of great success considering the numerous contributions and their applications to different problems and fields during the last two decades. One issue, however, that has been almost neglected so far is the consideration of multi-objective optimization problems (MOPs) that contain equality constraints. Such constraints play a special role as the inclusion of each equality constraint typically reduces the dimension of the search space by one. Consequently, the probability for a randomly chosen candidate solution of an equality constrained MOP to be feasible is zero, which makes the treatment of such problems very hard for EMO algorithms. In this paper, we propose a new benchmark of equality constrained MOPs. The problems are derived from the well-known DTLZ and IDTLZ problems and hence inherit their properties. The new benchmarks, Eq-DTLZ and Eq-IDTLZ, are scalable both in decision and objective space as well as in the number of equality constraints. Furthermore, all Pareto sets differ from the solution sets of the unconstrained problems and can be expressed analytically which make them good candidates for testing EMO algorithms on this important problem class. Based on the new benchmark, we investigate the performance of some state-of-the-art evolutionary algorithms. The results show that the new problems are indeed hard to solve for all considered algorithms and that further investigation has to be done for the reliable treatment of equality constrained MOPs.
Keyword:
Evolutionary computation
Multi-objective optimization
Equality constraints
Benchmarking
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量
An improved differential evolution algorithm for optimization including linear equality constraints
MEMETIC COMPUTING
IF2.3
Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms用元启发式算法求解双目标交通选址路径问题

