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

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient mixing of building blocks is important for genetic algorithms and linkage identification methods that identify interdependent variables tightly linked to form a building block have been proposed. However, they have not been applied to real-world problems enough. In this chapter, we apply 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 linkage identification genetic algorithms. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tsuji, M., Munetomo, M., & Akama, K. (2008). A network design problem by a GA with linkage identification and recombination for overlapping building blocks. Studies in Computational Intelligence, 157, 441–459. https://doi.org/10.1007/978-3-540-85068-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free