改变之轮的润滑:适应性自动问题分解在非平稳环境中的作用
Oiling the Wheels of Change: The Role of Adaptive Automatic Problem Decomposition in Non--Stationary Environments
摘要:
遗传算法(GeneticAlgorithms,GAs)能够快速、可靠、准确地解决复杂问题,被称为胜任GAs。当问题的适应度景观随时间变化时,该问题称为非平稳、动态或时变问题。本文研究了如何使用胜任遗传算法优化非平稳优化问题。更具体地说,我们使用基于最小描述长度原则的信息理论方法来自适应地识别可用于快速响应环境变化的子结构和子结构。我们还开发了一种特殊类型的问题,有界困难,以测试非平稳优化问题。结果提供了新的见解,非平稳优化问题,并表明,搜索算法,自动识别和利用可能的分解比一个简单的遗传算法更强大,响应速度更快的变化。
英文摘要:
Genetic algorithms (GAs) that solve hard problems quickly, reliably and accurately are called competent GAs. When the fitness landscape of a problem changes overtime, the problem is called non--stationary, dynamic or time--variant problem. This paper investigates the use of competent GAs for optimizing non--stationary optimization problems. More specifically, we use an information theoretic approach based on the minimum description length principle to adaptively identify regularities and substructures that can be exploited to respond quickly to changes in the environment. We also develop a special type of problems with bounded difficulties to test non--stationary optimization problems. The results provide new insights into non-stationary optimization problems and show that a search algorithm which automatically identifies and exploits possible decompositions is more robust and responds quickly to changes than a simple genetic algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。