Skip to main content

Adjusting Population Distance for the Dual-Population Genetic Algorithm

  • Conference paper
AI 2007: Advances in Artificial Intelligence (AI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4830))

Included in the following conference series:

Abstract

A dual-population genetic algorithm (DPGA) is a new multi-population genetic algorithm that solves problems using two populations with different evolutionary objectives. The main population is similar to that of an ordinary genetic algorithm, and it evolves in order to obtain suitable solutions. The reserve population evolves to maintain and offer diversity to the main population. The two populations exchange genetic materials using interpopulation crossbreeding. This paper proposes a new fitness function of the reserve population based on the distance to the main populations. The experimental results have shown that the performance of DPGA is highly related to the distance between the populations and that the best distance differs for each problem. Generally, it is difficult to decide the best distance between the populations without prior knowledge about the problem. Therefore, this paper also proposes a method to dynamically adjust the distance between the populations using the distance between good parents, i.e., the parents that generated good offspring.

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

  1. Bäck, T.: The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In: Parallel Problem Solving from Nature 2, PPSN-II, pp. 87–96. Elsevier, Amsterdam (1992)

    Google Scholar 

  2. Back, T.: Optimal mutation rates in genetic search. In: 5th International Conference on Genetic Algorithms, pp. 2–8. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  3. Goldberg, D.E., Richardson, J.: Genetic Algorithms with sharing for multimodal function optimization. In: 2nd International Conference on Genetic Algorithm, Cambridge, Massachusetts, pp. 41–49 (1987)

    Google Scholar 

  4. Miller, B.L., Shaw, M.J.: Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: IEEE International Conference on Evolutionary Computation, pp. 786–791. IEEE press, Los Alamitos (1996)

    Chapter  Google Scholar 

  5. De Jong, K.A: An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan, Ann Arbor  (1975)

    Google Scholar 

  6. Cantu-Paz, E.: A survey of parallel genetic algorithm. Technical Report, Illinois Genetic Algorithms Laboratory (1997)

    Google Scholar 

  7. Whitley, D., Rana, S., Heckendorn, R.B.: The island model genetic algorithm: on separability, population size and convergence. In: the AISB Workshop on Evolutionary Computation (1998)

    Google Scholar 

  8. Ursem, R.K.: Multinational evolutionary algorithms. In: IEEE Congress on Evolutionary Computation, vol. 3, pp. 1633–1640. IEEE Press, Los Alamitos (1999)

    Google Scholar 

  9. Tsutsui, S., Fujimoto, Y.: Forking genetic algorithm with blocking and shrinking modes (FGA). In: the 5th International Conference on Genetic Algorithms, pp. 206–215. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  10. Jie, Y., Kharma, N., Grogono, P.: BMPGA: a bi-objective multi-population genetic algorithm for multi-modal function optimization. In: IEEE Congress on Evolutionary Computation, vol. 1, pp. 816–823. IEEE Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  11. Park, T., Ryu, K.R.: A dual-population genetic algorithm for balanced exploration and exploitation. In: Computational Intelligence, pp. 88–93. ACTA Press (2006)

    Google Scholar 

  12. Park, T., Ryu, K.R.: A dual population genetic algorithm with evolving diversity. In: IEEE Congress on Evolutionary Computation (to be published, 2007)

    Google Scholar 

  13. Wineberg, M., Oppacher, F.: Distances between populations. 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. 1481–1492. Springer, Heidelberg (2003)

    Google Scholar 

  14. Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating evolutionary algorithms. Artificial Intelligence, 245–276 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mehmet A. Orgun John Thornton

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, T., Choe, R., Ryu, K.R. (2007). Adjusting Population Distance for the Dual-Population Genetic Algorithm. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76928-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76926-2

  • Online ISBN: 978-3-540-76928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics