Skip to main content

Dynamic Function Optimisation: Comparing the Performance of Clonal Selection and Evolution Strategies

  • Conference paper
Artificial Immune Systems (ICARIS 2003)

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

Included in the following conference series:

Abstract

This paper reports on novel work using clonal selection (CS) for dynamic function optimisation. A comparison is made between evolution strategies (ES) and CS, for the optimisation of two significantly different dynamic functions at 2, 5 and 10 dimensions. Firstly a sensitivity analysis was performed for both the CS and the ES for both fitness functions. Secondly the performance of the two algorithms was compared over time. The main finding of this work is that the CS optimises better than the ES in problems with few dimensions, although the ES optimises more slowly. At higher dimensions however, the ES optimises both more quickly and to a better level.

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

  • Back, T., Schwefel, H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation 1(1), 1–23 (1993)

    Article  Google Scholar 

  • Branke, J.: Evolutionary approaches to dynamic optimization problems – a survey. In: Wu, A. (ed.) GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pp. 134–137 (1999)

    Google Scholar 

  • Burnet, F.M.: The Clonal Selection Theory of Acquired Immunity. Cambridge University Press, Cambridge (1959)

    Google Scholar 

  • Cobb, H.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time dependent nonstationary environments. NRL Memornadum Report 6760 (NCARAI report AIC-90-001) (1990)

    Google Scholar 

  • Cobb, H., Grefenstette, J.: Genetic algorithms for tracking changing environments. In: Genetic Algorithms: Proceedings of the 5th international conference ICGA 1993, pp. 523–530 (1993)

    Google Scholar 

  • Dasgupta, D., McGregor, D.: Nonstationary function optimisation using the structured genetic algorithm. In: Proceedings of Parallel Problem Solving from Nature (PPSN 1992), pp. 145–154 (1992)

    Google Scholar 

  • de Castro, L.N., Von Zuben, F.J.: The clonal selection algorithm with engineering applications. In: Proceedings of GECCO 2000, Workshop on Artificial Immune Systems and Their Applications, pp. 36–37 (2000)

    Google Scholar 

  • Eggermont, J., Lenaerts, T., Poyhonen, S., Termier, A.: Raising the dead; extending evolutionary algorithms with a case-based memory. In: Proceedings of 2nd European Conference on Genetic Programming, EuroGP 2001 (2001)

    Google Scholar 

  • Fogel, D.B.: Evolutionary Computation - Towards a New Philosophy of Machine Intelligence. IEEE Press, New York (1995)

    Google Scholar 

  • Garrett, S., Walker, J.: Combining evolutionary and ‘non’-evolutionary methods in tracking dynamic global optima. In: Genetic and Evolutionary Computation Conference, GECCO 2002, pp. 359–366 (2002)

    Google Scholar 

  • Gaspar, A., Collard, P.: From GAs to artificial immune systems: Improving adaptation in time dependent optimization. In: Proceedings of the Congress on Evolutionary Computation, vol. 3, pp. 1859–1866. IEEE Press, Mayflower Hotel (1999)

    Google Scholar 

  • Grefenstette, J.: Genetic algorithms for changing environments. In: Proceedings of Parallel Problem Solving from Nature 2. pp. 137–144 (1992)

    Google Scholar 

  • Mitchell, M., Holland, J., Forrest, S.: When will a genetic algorithm outperform hill climbing? Neural Information Processing Systems 6, 51–58 (1993)

    Google Scholar 

  • Oppacher, F., Wineberg, M.: The shifting balance genetic algorithm: Improving the GA in a dynamic environment. In: The Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, pp. 504–510 (1999)

    Google Scholar 

  • Walker, J.: Experiments in evolutionary robotics: investigating the importance of training and lifelong adaptation by evolution. Ph.D. thesis, Department of Computer Science, University of Wales, Aberystwyth (2003)

    Google Scholar 

  • Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walker, J.H., Garrett, S.M. (2003). Dynamic Function Optimisation: Comparing the Performance of Clonal Selection and Evolution Strategies. In: Timmis, J., Bentley, P.J., Hart, E. (eds) Artificial Immune Systems. ICARIS 2003. Lecture Notes in Computer Science, vol 2787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45192-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45192-1_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40766-9

  • Online ISBN: 978-3-540-45192-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics