SELF-ADAPTIVE INTEGER AND DECIMAL MUTATION OPERATORS FOR GENETIC ALGORITHMS

Ghodrat Moghadampour

Abstract

Evolutionary algorithms are affected by more parameters than optimization methods typically. This is at the same time a source of their robustness as well as a source of frustration in designing them. Adaptation can be used not only for finding solutions to a given problem, but also for tuning genetic algorithms to the particular problem. Adaptation can be applied to problems as well as to evolutionary processes. In the first case adaptation modifies some components of genetic algorithms to provide an appropriate form of the algorithm, which meets the nature of the given problem. These components could be any of representation, crossover, mutation and selection. In the second case, adaptation suggests a way to tune the parameters of the changing configuration of genetic algorithms while solving the problem. In this paper two new self-adaptive mutation operators; integer and decimal mutation are proposed for implementing efficient mutation in the evolutionary process of genetic algorithm for function optimization. Experimentation with 27 test cases and 1350 runs proved the efficiency of these operators in solving optimization problems.

References

  1. A. Eiben and J. Smith 2007. Introduction to Evolutionary Computing. Natural Computing Series. Springer, 2nd edition.
  2. Bäck, Thomas, David B. Fogel, Darrell Whitely & Peter J. Angeline 2000. Mutation operators. In: Evolutionary Computation 1, Basic Algorithms and Operators. Eds T. Bäck, D. B. Fogel & Z. Michalewicz. United Kingdom: Institute of Physics Publishing Ltd, Bristol and Philadelphia. ISBN 0750306645.
  3. De Jong, K. A. 1975. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan. Michigan: Ann Arbor.
  4. Eshelman, L. J. & J. D. Schaffer 1991. Preventing premature convergence in genetic algorithms by preventing incest. In Proceedings of the Fourth International Conference on Genetic Algorithms. Eds R. K. Belew & L. B. Booker. San Mateo, CA: Morgan Kaufmann Publishers.
  5. G. Eiben and M. C. Schut 2008. New Ways To Calibrate Evolutionary Algorithms. In Advances in Metaheuristics for Hard Optimization, pages 153-177.
  6. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: MI: University of Michigan Press.
  7. Mengshoel, Ole J. & Goldberg, David E. 2008. The crowding approach to niching in genetic algorithms. Evolutionary Computation, Volume 16, Issue 3 (Fall 2008). ISSN:1063-6560.
  8. Michalewicz, Zbigniew 2000. Introduction to search operators. In Evolutionary Computation 1, Basic Algorithms and Operators. Eds T. Bäck, D. B. Fogel & Z. Michalewicz. United Kingdom: Institute of Physics Publishing Ltd, Bristol and Philadelphia. ISBN 0750306645.
  9. Mitchell, Melanie 1998. An Introducton to Genetic Algorithms. United States of America: A Bradford Book. First MIT Press Paperback Edition.
  10. Moghadampour, Ghodrat 2006. Genetic Algorithms, Parameter Control and Function Optimization: A New Approach. PhD dissertation. ACTA WASAENSIA 160, Vaasa, Finland. ISBN 952-476-140-8.
  11. Mühlenbein, H. 1992. How genetic algorithms really work: 1. mutation and hill-climbing. In: Parallel Problem Solving from Nature 2. Eds R. Männer & B. Manderick. North-Holland.
  12. S. K. Smit and A. E. Eiben 2009. Comparing Parameter Tuning Methods for Evolutionary Algorithms. In IEEE Congress on Evolutionary Computation (CEC), pages 399-406, May 2009.
  13. Smith, R. E., S. Forrest & A. S. Perelson 1993. Population diversity in an immune system model: implications for genetic search. In Foundations of Genetic Algorithms 2. Ed. L. D. Whitely. Morgan Kaufmann.
  14. Spears, W. M. 1993. Crossover or mutation? In: Foundations of Genetic Algorithms 2. Ed. L. D. Whitely. Morgan Kaufmann.
  15. Ursem, Rasmus K. 2003. Models for Evolutionary Algorithms and Their Applications in System Identification and Control Optimization (PhD Dissertation). A Dissertation Presented to the Faculty of Science of the University of Aarhus in Partial Fulfillment of the Requirements for the PhD Degree. Department of Computer Science, University of Aarhus, Denmark.
  16. Whitley, Darrell 2000. Permutations. In Evolutionary Computation 1, Basic Algorithms and Operators. Eds T. Bäck, D. B. Fogel & Z. Michalewicz. United Kingdom: Institute of Physics Publishing Ltd, Bristol and Philadelphia. ISBN 0750306645.
Download


Paper Citation


in Harvard Style

Moghadampour G. (2011). SELF-ADAPTIVE INTEGER AND DECIMAL MUTATION OPERATORS FOR GENETIC ALGORITHMS . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8425-54-6, pages 184-191. DOI: 10.5220/0003494401840191


in Bibtex Style

@conference{iceis11,
author={Ghodrat Moghadampour},
title={SELF-ADAPTIVE INTEGER AND DECIMAL MUTATION OPERATORS FOR GENETIC ALGORITHMS},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2011},
pages={184-191},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003494401840191},
isbn={978-989-8425-54-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - SELF-ADAPTIVE INTEGER AND DECIMAL MUTATION OPERATORS FOR GENETIC ALGORITHMS
SN - 978-989-8425-54-6
AU - Moghadampour G.
PY - 2011
SP - 184
EP - 191
DO - 10.5220/0003494401840191