arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.05825cs.NEmath.OC
收藏

动态约束优化问题的约束处理技术比较

A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems

Maria-Yaneli Ameca-Alducin, Maryam Hasani-Shoreh, Wilson Blaikie, Frank Neumann, Efren Mezura-Montes

摘要:

动态约束优化问题(DCOPs)近年来受到了研究人员的关注,因为绝大多数现实世界中的问题随时间而变化。在静态优化问题中,约束处理技术的作用已经有了研究。然而,缺乏任何实质性的研究,在最流行的约束处理技术的行为时,处理DCOP。在本文中,我们研究了四个最流行的约束处理技术,并应用一个简单的差分进化(DE)算法加上变化检测机制来观察这些技术的行为。使用通用基准对这些行为进行分析,以确定哪些技术适合最流行的DCOP类型。为了进行分析,对静态环境中的常用措施进行了调整,以适应动态环境。虽然无法确定总体上更好的技术,但某些技术在不同方面优于其他技术,如优化速度或解决方案的可靠性。

英文摘要:

Dynamic constrained optimization problems (DCOPs) have gained researchers attention in recent years because a vast majority of real world problems change over time. There are studies about the effect of constrained handling techniques in static optimization problems. However, there lacks any substantial study in the behavior of the most popular constraint handling techniques when dealing with DCOPs. In this paper we study the four most popular used constraint handling techniques and apply a simple Differential Evolution (DE) algorithm coupled with a change detection mechanism to observe the behavior of these techniques. These behaviors were analyzed using a common benchmark to determine which techniques are suitable for the most prevalent types of DCOPs. For the purpose of analysis, common measures in static environments were adapted to suit dynamic environments. While an overall superior technique could not be determined, certain techniques outperformed others in different aspects like rate of optimization or reliability of solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑