Skip to main content

A New Model of Parallel Distributed Genetic Algorithms for Cluster Systems: Dual Individual DGAs

  • Conference paper
  • First Online:
High Performance Computing (ISHPC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1940))

Included in the following conference series:

Abstract

A new model of parallel distributed genetic algorithm, Dual Individual Distributed Genetic Algorithm (DuDGA), is proposed. This algorithm frees the user from having to set some parameters because each island of Distributed Genetic Algorithm (DGA) has only two individuals. DuDGA can automatically determine crossover rate, migration rate, and island number. Moreover, compared to simple GA and DGA methods, DuDGA can find better solutions with fewer analyses. Capability and effectiveness of the DuDGA method are discussed using four typical numerical test functions.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  • T. C. Belding (1995). The Distributed Genetic Algorithms Revised, Proc. of 6th Int. Conf. Genetic Algorithms,114–121.

    Google Scholar 

  • E. Cantu-Paz (1999). Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms, Proceedings of GECCO 1999,91–98.

    Google Scholar 

  • D. E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.

    Google Scholar 

  • V. S. Gordon and D. Whitley (1993). Serial and Parallel Genetic Algorithms as Function Optimizers, Proc. of 5th Int. Conf. Genetic Algorithms.

    Google Scholar 

  • M. Miki, T. Hiroyasu and K. Hatanaka (1999). Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme, Proc. 3rd World Congress of Structural and Multidisciplinary Optimization (WCSMO), Vol. 1,186–191.

    Google Scholar 

  • M. Munemoto, Y. Takai and Y. Sato (1993). An efficient migration scheme for subpopulation based asynchronously parallel genetic algorithms, Proceedings of the Fifth International Conference on Genetic Algorithms, 649–159.

    Google Scholar 

  • J. Nang and K. Matsuo (1994). A Survey on the Parallel Genetic Algorithms, J. SICE, Vol. 33, No.6, 500–509.

    Google Scholar 

  • R. Tanese (1989). Distributed Genetic Algorithms, Proc. of 3rd Int. Conf. Genetic Algorithms, 432–439.

    Google Scholar 

  • D. Whitley, et. al. (1997). Island Model Genetic Algorithms and Linearly Separable Problems, Proc. of AISB Workshop on Evolutionary Computation

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hiroyasu, T., Miki, M., Hamasaki, M., Tanimura, Y. (2000). A New Model of Parallel Distributed Genetic Algorithms for Cluster Systems: Dual Individual DGAs. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-39999-2_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41128-4

  • Online ISBN: 978-3-540-39999-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics