径向基函数和粗糙集在进化多目标优化中的应用

文献引用

链接

Use of Radial Basis Functions and Rough Sets for Evolutionary Multi-Objective Optimization

Bibtex

@inproceedings{inproceedings,
author = {Santana-Quintero, Luis and Serrano-Hernandez, Victor and Coello, Carlos and Hernández-Díaz, Alfredo and Molina, Julian},
year = {2007},
month = {05},
pages = {107 - 114},
title = {Use of Radial Basis Functions and Rough Sets for Evolutionary Multi-Objective Optimization},
isbn = {1-4244-0702-8},
doi = {10.1109/MCDM.2007.369424}
}

怎么看到这篇文章的

源自Akhtar2015Multi的参考文献。

摘要

原文

This paper presents a new multi-objective evolutionary algorithm (MOEA) which adopts a radial basis function (RBF) approach in order to reduce the number of fitness function evaluations performed to reach the Pareto front. The specific method adopted is derived from a comparative study conducted among several RBFs. In all cases, the NSGA-II (which is an approach representative of the state-of-the-art in the area) is adopted as our search engine with which the RBFs are hybridized. The resulting algorithm can produce very reasonable approximations of the true Pareto front with a very low number of evaluations, but is not able to spread solutions in an appropriate manner. This led us to introduce a second stage to the algorithm in which it is hybridized with rough sets theory in order to improve the spread of solutions. Rough sets, in this case, act as a local search approach which is able to generate solutions in the neighborhood of the few nondominated solutions previously generated. We show that our proposed hybrid approach only requires 2,000 fitness function evaluations in order to solve test problems with up to 30 decision variables. This is a very low value when compared with today’s standards reported in the specialized literature.

有特点的地方

• 提出了一种新的多目标进化算法，使用径向基网络作为元模型。
• 为了以适当的方式探索新的解，引入了算法的第二阶段，在该阶段中，它与粗糙集理论相结合。将粗糙集作为一种局部搜索方法，能够在先前的非支配解的邻域中生成解。

主要内容

求解的是多目标优化问题，引入代理模型的原因是为了减少函数评估次数。

算法框架

粗糙集迭代（Rough Sets）

将决策空间划分为一个一个网格，判断哪些网格的点是最优的，然后基于粗糙集理论进行局部搜索。

为了创建这个网格，作为输入，将有N个可行点分为两组：非支配点（ES）和支配点（DS）。使用这两个集合，希望创建一个网格来描述集合ES，以便加强对它的搜索。也就是说，想在决策变量空间中描述帕累托前沿，因为这样我们可以很容易地利用这些信息生成更有效的点，然后改进初始近似*。

如何使用网格将目标函数空间中的信息转换为决策变量空间中的信息。

总结

1. 这篇文章提出了一种新的多目标进化算法，该算法使用RBF网络作为代理模型，并借助代理模型对昂贵函数评估进行选点。
2. 对比了各种RBF函数的效果。
3. 在算法中引入了第二阶段，将其与粗糙集理论相结合，加强局部搜索，以提高解（非支配解）的传播速度。为了在决策空间中描述出Pareto前沿的信息，在决策空间中构建网格。