Skip to main content

Dynamics in Proportionate Selection.

  • Conference paper
  • 964 Accesses

Abstract

This paper proposes a new selection method for Genetic Algorithms. The motivation behind the proposed method is to investigate the effect of different selection methods on the rate of convergence. The new method Dynamic Selection Method (DSM) is based on proportionate selection. DSM functions by continuously changing the criteria for parent selection (dynamic) based on the number of generations in a run and the current generation. Results show that by using DSM to maintain diversity in a population gives slower convergence, but, their overall performance was an improvement. Relationship between slower convergences, in GA runs, leading to better solutions, has been identified.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Holland, J. (1975). Adaptation In Search, Optimization & Machine Learning. Addison-Wesley, 1989 Natural and Artificial Systems. The University of Michigan Press, Ann Arbor.

    Google Scholar 

  2. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  3. Back T. (1996). Evolutionary Algorithms in Theory and Practice, Oxford University Press, NY.

    Google Scholar 

  4. Goldberg, D. E. and Deb, K., "A Comparative Analysis of Selection Schemes Used in Genetic Algorithms," in FGA1, pp.69–93, 1991

    Google Scholar 

  5. Baker, J. E.: Adaptive Selection Methods for Genetic Algorithms. Proceedings of an International Conference on Genetic Algorithms and their Application, pp. 101–111, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1985

    Google Scholar 

  6. E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys. The Traveling Salesman Problem. John Wiley, 1985.

    Google Scholar 

  7. G. Reinelt. TSPLIB-a traveling salesman problem library. ORSA J. Computing, 3:376–384, 1991.

    MATH  Google Scholar 

  8. I. Oliver, D. Smith, and J. Holland. A study of permutation crossover operators on the travelling salesman problem. In Grefenstette J.J.

    Google Scholar 

  9. Larrañaga, P, C. Kuijpers, R. Murga, I. Inza and S. Dizdarevich. "Evolutionary algorithms for the travelling salesman problem: A review of representations and operators", Artificial Intelligence Review, Vol. 13 (1999), pp. 129–170.

    Article  Google Scholar 

  10. Whitley, D. (1989). The GENITOR Algorithm and Selective Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. In Proc. 3th International Conf. on Genetic Algorithms. 116, D. Schaffer, ed., Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag/Wien

About this paper

Cite this paper

Agrawal, A., Mitchell, I., Passmore, P., Litovski, I. (2005). Dynamics in Proportionate Selection.. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna. https://doi.org/10.1007/3-211-27389-1_54

Download citation

  • DOI: https://doi.org/10.1007/3-211-27389-1_54

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-24934-5

  • Online ISBN: 978-3-211-27389-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics