Skip to main content

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

  • Chapter
Linkage in Evolutionary Computation

Part of the book series: Studies in Computational Intelligence ((SCI,volume 157))

  • 470 Accesses

Summary

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)

    MATH  Google Scholar 

  2. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)

    Google Scholar 

  3. Munetomo, M., Goldberg, D.E.: Identifying linkage groups by nonlinearity/non-monotonicity detection. In: Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 1999, pp. 433–440. Morgan Kaufmann Publishers, San Francisco (July 1999)

    Google Scholar 

  4. Heckendorn, R.B., Wright, A.H.: Efficient linkage discovery by limited probing. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1003–1014. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Kargupta, H., Park, B.H.: Gene expression and fast construction of distributed evolutionary representation. Evolutionary Computation 9(1), 43–69 (2001)

    Article  Google Scholar 

  6. Streeter, M.J.: Upper bounds on the time and space complexity of optimizing additively separable functions. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 186–197. Springer, Heidelberg (2004)

    Google Scholar 

  7. Tsuji, M., Munetomo, M., Akama, K.: Modeling dependencies of loci with string classification according to fitness differences. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 246–257. Springer, Heidelberg (2004)

    Google Scholar 

  8. Tsuji, M., Munetomo, M., Akama, K.: Linkage identification by fitness difference clustering. Evolutionary Computation 14(4), 383–409 (2006)

    Article  Google Scholar 

  9. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  10. Tsuji, M., Munetomo, M., Akama, K.: A crossover for complex building blocks overlapping. In: Proceedings of the Genetic and Evolutionary Computation - GECCO2006, pp. 1337–1344. ACM Press, New York (2006)

    Google Scholar 

  11. Yu, T.L., Sastry, K., Goldberg, D.E.: Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination. In: Proceedings of the Genetic and evolutionary computation conference - GECCO 2005, pp. 1217–1224 (June 2005)

    Google Scholar 

  12. Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3(5), 415–444 (1989)

    MathSciNet  Google Scholar 

  13. Kargupta, H.: The gene expression messy genetic algorithm. In: Proceedings of the IEEE International Conference on Evolutionary Computation (CEC), pp. 631–636 (September 1996)

    Google Scholar 

  14. Munetomo, M.: Linkage identification based on epistasis measures to realize efficient genetic algorithms. In: Proceedings of the Congress on Evolutionary Computation - CEC 2002, pp. 445–452 (2002)

    Google Scholar 

  15. Pelikan, M., Goldberg, D.E., Lobo, F.G.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5–20 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: The Bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 1999, pp. 525–532. Morgan Kaufmann Publishers, San Francisco (1999)

    Google Scholar 

  17. Etxeberria, R., Larrañaga, P.: Global optimization with bayesian networks. In: Proceedings of the II Symposium on Artificial Intelligence CIMAF 1999, Special Session on Distributions and Evolutionary Optimization, pp. 332–339 (1999)

    Google Scholar 

  18. Tsuji, M., Munetomo, M., Akama, K.: Population sizing of dependency detection by fitness difference classification. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol. 3469, pp. 282–299. Springer, Heidelberg (2005)

    Google Scholar 

  19. Booker, L.: Improving search in genetic algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 61–73. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  20. Kumar, A., Pathak, R.M., Gupta, Y.P., Parsaei, H.R.: A genetic algorithm for distributed system topology design. Computers and Industrial Engineering 28(3), 659–670 (1995)

    Article  Google Scholar 

  21. Sinclair, M.C.: Nomad: Initial architecture of an optical network optimisation, modelling and design tool. In: Proceedings of the 12th UK Performance Engineering Workshop, pp. 157–167 (September 1996)

    Google Scholar 

  22. Munetomo, M., Tsuji, M., Akama, K.: Metropolitan area network design using ga based on linkage identification with epistasis measures. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 652–656 (2002)

    Google Scholar 

  23. Tsuji, M., Munetomo, M., Akama, K.: Metropolitan area network design using GA based on hierarchical linkage identification. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1616–1617. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Munetomo, M., Goldberg, D.E.: Linkage identification by non-monotonicity detection for overlapping functions. Technical Report IlliGAL Report No.99005, University of Illinois at Urbana-Champaign (January 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ying-ping Chen Meng-Hiot Lim

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tsuji, M., Munetomo, M., Akama, K. (2008). A Network Design Problem by a GA with Linkage Identification and Recombination for Overlapping Building Blocks. In: Chen, Yp., Lim, MH. (eds) Linkage in Evolutionary Computation. Studies in Computational Intelligence, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85068-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85068-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85067-0

  • Online ISBN: 978-3-540-85068-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics