Skip to main content

Elitism Between Populations for the Improvement of the Fitness of a Genetic Algorithm Solution

  • Conference paper
  • First Online:
Book cover Novel Algorithms and Techniques in Telecommunications and Networking
  • 1350 Accesses

Abstract

The use of Elitism within Genetic Algorithms is well documented allowing the best solution from any generation to be carried across to the new population allowing it to survive intact. This paper is looking at a similar concept of using Elitism across solutions rather than just each of the generations. The consideration is to use previous solutions to improve the fitness of the current population when applied to a similar problem. Usage within our context is for the placement of data object replicas within a cellular phone network for the benefit of the user base.

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 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
Hardcover Book
USD 219.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.

Reference

  1. Holland, 1975, “Adaptation in Natural and Artificial Systems”, University of Michigan press, ISBN 0262581116

    Google Scholar 

  2. Gotshall, Rylander, 2002, “Optimal population size and the Genetic Algorithm”, WSEAS 2002, February 11–15, 2002, Interlaken, Switzerland

    Google Scholar 

  3. Goldberg, Deb, 1991, “A comparative analysis of selection schemes used in genetic algorithms”, Foundations of Genetic Algorithms, G. J. E. Rawlins, ed., pp. 69–93.

    Google Scholar 

  4. De Jong, 1975, “An analysis of the behaviour of a class of genetic adaptive Systems” Doctoral Dissertation, University of Michigan Microfilm 76–9381

    Google Scholar 

  5. Braun, T.D., Siegal, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Bin Yao, Hensgen, D., Freund, R.F., 1999, “A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems”, Heterogeneous Computing Workshop, 1999. (HCW ‘99) Proceedings. Eighth, 12 April 1999 Pages15 – 29

    Google Scholar 

  6. Champion, Yu, Sunley, 2006, “Ordering of Replicated objects within a cellular 3rd Generation Network using a Genetic Solution to place the Data”, Proceedings of the Seventh Informatics Workshop, ISBN: 1-8514-3232-9

    Google Scholar 

  7. MDA , 2008, “MDA Stats Reveal Mobile Data Growth”, http://www.mobilemarketingmagazine.co.uk/2008/07/mda-stats-revea.html

  8. Champion, Rees, Sunley, 2003, “Placement of Data within a Third Generation network using a Genetic solution”, PGNET 2004 Evolutionary Computation, 1 (1), pp. 25–49, 1993.

    Google Scholar 

  9. Chang, Ramakrishna ,2002, “Elitism-based compact genetic algorithms” Evolutionary Computation, IEEE Transactions on Volume 7, Issue 4, Aug. 2003 Page(s):367 – 385

    Google Scholar 

  10. Mühlenbein, H. and Schlierkamp-Voosen, D.: Predictive Models for the Breeder Genetic Algorithm: I. Continuous Parameter Optimization.

    Google Scholar 

  11. Loukopoulos, Ahmad ,2004, “Static and adaptive distributed data replication using genetic algorithms”, Journal of Parallel and Distributed Computing archive, Pages 1270 – 1285 , ISSN:0743-7315

    Google Scholar 

  12. http://www.opnet.com, 2008

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Justin Champion .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Champion, J. (2010). Elitism Between Populations for the Improvement of the Fitness of a Genetic Algorithm Solution. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_39

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3662-9_39

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3661-2

  • Online ISBN: 978-90-481-3662-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics