Skip to main content

Integrated-Adaptive Genetic Algorithms

  • Conference paper
Advances in Artificial Life (ECAL 2003)

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

Included in the following conference series:

Abstract

This paper proposes two general techniques for adapting operators in a genetic algorithm: one dynamically adjusts their rates, while the other customizes their specific way of operation. We show how these techniques can be integrated into a single evolutionary system, called Integrated-Adaptive Genetic Algorithm (IAGA). The IAGA exhibits fewer input parameters to adjust than the original GA, while being able to automatically adapt itself to the particularities of the optimization problem it tackles. We present a proof-of-concept implementation of this technique for royal road functions.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bäck, T.: Optimal Mutation Rates in Genetic Search. In: Proceedings of the Fifth International Conference on Genetic Algorithms (1993)

    Google Scholar 

  2. Julstrom, B.A.: What Have You Done for me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. In: Proceedings of the Sixth International Conference on Genetic Algorithms (1995)

    Google Scholar 

  3. Kosorukoff, A.: Using incremental evaluation and adaptive choice of operators in a genetic algorithm. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference (2000)

    Google Scholar 

  4. Lis, J., Lis, M.: Self-adapting Parallel Genetic Algorithms with the Dynamic Mutation Probability, Crossover Rate and Population Size. In: Proceedings of the 1st Polish National Conference on Evolutionary Computation (1996)

    Google Scholar 

  5. Michalewich, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1996)

    Google Scholar 

  6. Michalewich, Z., Fogel, D.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2002)

    Google Scholar 

  7. Mitchell, M., Forest, S., Holland, J.H.: The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance. In: Proceedings of First ECAL (1992)

    Google Scholar 

  8. Pelikan, M., Goldberg, D.E., Tsutsui, S.: Combining the strengths of Bayesian optimization algorithm and adaptive evolution strategies. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference (2000)

    Google Scholar 

  9. Spears, W.M.: Adapting Crossover in Evolutionary Algorithms. In: Proceedings of the 4th Annual Conference on Evolutionary Programming (1995)

    Google Scholar 

  10. Thierens, D.: Adaptive mutation rate control schemes in genetic algorithms. In: Proceedings of the 2002, Congress on Evolutionary Computation CEC2002 (2002)

    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

Luchian, H., Gheorghieş, O. (2003). Integrated-Adaptive Genetic Algorithms. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds) Advances in Artificial Life. ECAL 2003. Lecture Notes in Computer Science(), vol 2801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39432-7_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39432-7_68

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39432-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics