Real-Coded Genetic Algorithms Based on Mathematical Morphology

  • Dolores Barrios
  • Daniel Manrique
  • Jaime Porras
  • Juan Ríos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1876)


The goal of this work is to propose a general-purpose crossover operator for real-coded genetic algorithms that is able to avoid the major problems found in this kind of approach such as the premature convergence to local optima, the weakness of genetic algorithms in local fine-tuning and the use of real-coded genetic algorithms instead of the traditional binary-coded problems. Mathematical morphology operations have been employed with this purpose adapting its meaning from other application fields to the generation of better individuals along the evolution in the convergence process. This new crossover technique has been called mathematical morphology crossover (MMX) and it is described along with the resolution of systematic experiments that allow to test its high speed of convergence to the optimal value in the search space.


Genetic Algorithm Local Optimum Crossover Operator Premature Convergence Mathematical Morphology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley (1989).Google Scholar
  2. 2.
    Kureichick, V., Melikhov, A. N., Miaghick, V. V., Savelev, O. V., Topchy, A. P.: Some New Features in the Genetic Solution of the Traveling Salesman Problem. Proceedings of the 2nd International Conference of the Integration of Genetic Algorithms and Neural Network Computing and Related Adaptive Computing with Current Engineering Practice, ACEDC’96, Plymouth (1996) 231–247.Google Scholar
  3. 3.
    Rocha, M., Neves, J.: Preventing Premature Convergence to Local Optima in Genetic Algorithms via Random Offspring Generation. Proceedings of the 12th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Springer-Verlag, Cairo (1999) 127–136.Google Scholar
  4. 4.
    Barrios, D.: Generalized Crossover Operator for Genetic Algorithms. PhD Thesis, Facultad de Informática, Universidad Politécnica de Madrid, Madrid (1991).Google Scholar
  5. 5.
    Eshelman, L. J., Schaffer, J. D.: Real-Coded Genetic Algorithms and Interval-Schemata. Foundations of Genetic Algorithms, 2 (1993).Google Scholar
  6. 6.
    Wright, A.: Genetic Algorithms for Real Parameter Optimization. Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA (1991) 205–218.Google Scholar
  7. 7.
    Radcliffe, N. J.: Genetic Neural Networks on MIMD Computers. PhD Dissertation, Dept. of Theoretical Phisics, University of Edinburgh, Edinburgh, UK (1990).Google Scholar
  8. 8.
    Ono I., Kobayashi, S.: A Real-Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover. Proceedings of 7th International Conference on Genetic Algorithms (1997) 246–253.Google Scholar
  9. 9.
    Crespo, J.: Morphological Connected Filters and Intra-Region Smoothing for Image Segmentation. PhD thesis, Georgia Institute of Technology, Atlanta (1993).Google Scholar
  10. 10.
    D’Alotto, L. A., Giardina, C. R.: A Unified Signal Algebra Approach to Two-Dimensional Parallel Digital Signal Processing. Marcel Dekker, New York (1998).zbMATHGoogle Scholar
  11. 11.
    González, R. C, Woods, R. E.: Digital Image Processing. Addison Wesley, New York, (1993).Google Scholar
  12. 12.
    Mars, P., Chen, J. R., Nambiar, R.: Learning Algorithms: Theory and Applications in Signal Processing, Control and Communications. CRC Press, New York (1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Dolores Barrios
    • 1
  • Daniel Manrique
    • 1
  • Jaime Porras
    • 1
  • Juan Ríos
    • 1
  1. 1.Facultad de InformáticaUniversidad Politécnica de MadridSpain

Personalised recommendations