A network design problem by a GA with linkage identification and recombination for overlapping building blocks

Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama

Abstract

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 D <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">5</sup> -GA with CDC - a genetic algorithm incorporating a linkage identification method called D <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">5</sup> 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.
BibTeX
@inproceedings{tsuji2008network,
  author = {Miwako Tsuji and Masaharu Munetomo and Kiyoshi Akama},
  title = {{A network design problem by a GA with linkage identification and recombination for overlapping building blocks}},
  booktitle = {Linkage in Evolutionary Computation},
  year = {2008},
  url = {https://openreview.net/forum?id=8t2_fygkdQ},
}

Loading related content...

Figure