A network design problem by a GA with linkage identification and recombination for overlapping building blocks
A network design problem by a GA with linkage identification and recombination for overlapping building blocks
复制标题
DOI：
10.1109/cec.2007.4424492
复制
发表时间：
2007-09
期刊：
影响因子：
--
通讯作者：
Miwako Tsuji;M. Munetomo;K. Akama
中科院分区：
文献类型：
--
作者：
Miwako Tsuji;M. Munetomo;K. Akama
构建块的有效混合对于遗传算法是重要的，并且已经提出了识别紧密链接以形成构建块的变量的链接识别。在本文中，我们应用D5-GA与CDC -遗传算法结合的连锁识别方法称为D5和交叉方法称为CDC -网络设计问题，以验证其性能和检查的适用性的连锁识别遗传算法。
Efficient mixing of building blocks is important for genetic algorithms and linkage identification that identify variables tightly linked to form a building block have been proposed. In this paper, we apply D5-GA with CDC - a genetic algorithm incorporating a linkage identification method called D5 and a crossover method called CDC - to a network design problem to verify its performance and examine the applicability of the linkage identification genetic algorithms.