RANDOM BUILDING BLOCK OPERATOR FOR GENETIC ALGORITHMS

Ghodrat Moghadampour

Abstract

Genetic algorithms work on randomly generated populations, which are refined toward the desired optima. The refinement process is carried out mainly by genetic operators. Most typical genetic operators are crossover and mutation. However, experience has proved that these operators in their classical form are not capable of refining the population efficiently enough. Moreover, due to lack of sufficient variation in the population, the genetic algorithm might stagnate at local optimum points. In this work a new dynamic mutation operator with variable mutation rate is proposed. This operator does not require any pre-fixed parameter. It dynamically takes into account the size (number of bits) of the individual during runtime and replaces a randomly selected section of the individual by a randomly generated bit string of the same size. All the bits of the randomly generated string are not necessarily different from bits of the selected section from the individual. Experimentation with 17 test functions, 34 test cases and 1020 test runs proved the superiority of the proposed dynamic mutation operator over single-point mutation operator with 1%, 5% and 8% mutation rates and the multipoint mutation operator with 5%, 8% and 15% mutation rates.

References

  1. Eiben, A. 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. Eiben, G. 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 (1996). Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition. USA: Springer. ISBN 3-540-60676-9.
  9. 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.
  10. Mitchell, Melanie, 1998. An Introducton to Genetic Algorithms. United States of America: A Bradford Book. First MIT Press Paperback Edition.
  11. 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.
  12. 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.
  13. Smit, S. K. and Eiben, A. E., 2009. Comparing Parameter Tuning Methods for Evolutionary Algorithms. In IEEE Congress on Evolutionary Computation (CEC), pages 399-406, May 2009.
  14. 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.
  15. Spears, W. M., 1993. Crossover or mutation? In: Foundations of Genetic Algorithms 2. Ed. L. D. Whitely. Morgan Kaufmann.
  16. 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.
  17. 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). RANDOM BUILDING BLOCK OPERATOR FOR GENETIC ALGORITHMS . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8425-54-6, pages 54-62. DOI: 10.5220/0003441400540062


in Bibtex Style

@conference{iceis11,
author={Ghodrat Moghadampour},
title={RANDOM BUILDING BLOCK OPERATOR FOR GENETIC ALGORITHMS},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2011},
pages={54-62},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003441400540062},
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 - RANDOM BUILDING BLOCK OPERATOR FOR GENETIC ALGORITHMS
SN - 978-989-8425-54-6
AU - Moghadampour G.
PY - 2011
SP - 54
EP - 62
DO - 10.5220/0003441400540062