Efficient graph based representation of multi-valued functions with an application to genetic algorithms
Efficient graph based representation of multi-valued functions with an application to genetic algorithms
复制标题
基于图的高效多值函数表示及其在遗传算法中的应用
DOI：
10.1109/ismvl.1994.302218
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
R. Drechsler
中科院分区：
文献类型：
--
作者：
B. Becker;R. Drechsler
提出了一种新的表示多值输入、多值输出函数的通用数据结构，称为函数图(FG)。有序FG被证明是一个典范形式。我们研究了只读一次的FG，并证明了类型受限的FG也是规范的。我们使用FGS来表示和操纵多值集合。它们允许对集合运算进行高效的操作算法，例如并集和交集。详细介绍了它在遗传算法中的应用。种群由多根FG表示。实验结果表明，这种新的表示方法是非常有效的，并且优于其他数据结构。
We present a new general data structure for representation of multi-valued input, multi-valued output functions, called function graphs (FG). Ordered FGs are shown to be a canonical form. We investigate read-once FGs and show that type-restricted FGs are also canonical. We use FGs for multi-valued set representation and manipulation. They allow efficient manipulation algorithms for set operations, e.g. union and intersection. An application to genetic algorithms (GAs) is presented in more detail. A population is represented by a multi-rooted FG. It is shown by experimental results that this new representation is very efficient and superior to other data structures for GAs.<<ETX>>