A Network Design Problem by a GA with Linkage Identification and Recombination for Overlapping Building Blocks

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-GA with CDC — a genetic algorithm incorporating a linkage identification method called D 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.

[1]  Masaharu Munetomo,et al.  Linkage Identification by Fitness Difference Clustering , 2006, Evolutionary Computation.

[2]  C. Sinclair.  Nomad: Initial Architecture of an Optical Network Optimisation, Modelling and Design Tool , 1996 .

[3]  David E. Goldberg,et al.  Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination , 2005, GECCO '05.

[4]  Masaharu Munetomo,et al.  Identifying Linkage Groups by Nonlinearity/Non-monotonicity Detection , 1999 .

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Masaharu Munetomo,et al.  Modeling Dependencies of Loci with String Classification According to Fitness Differences , 2004, GECCO.

[7]  Masaharu Munetomo,et al.  Linkage identification based on epistasis measures to realize efficient genetic algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[10]  Masaharu Munetomo,et al.  Metropolitan Area Network Design Using GA Based on Hierarchical Linkage Identification , 2003, GECCO.

[11]  Hillol Kargupta,et al.  Gene Expression and Fast Construction of Distributed Evolutionary Representation , 2001, Evolutionary Computation.

[12]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[13]  Alden H. Wright,et al.  Efficient Linkage Discovery by Limited Probing , 2003, Evolutionary Computation.

[14]  Matthew J. Streeter.  Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions , 2004, GECCO.

[15]  Anup Kumar,et al.  A genetic algorithm for distributed system topology design , 1995 .

[16]  David E. Goldberg,et al.  Linkage Identification by Non-monotonicity Detection for Overlapping Functions , 1999, Evolutionary Computation.

[17]  Masaharu Munetomo,et al.  A crossover for complex building blocks overlapping , 2006, GECCO '06.

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .