Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley (1989).
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.
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.
Barrios, D.: Generalized Crossover Operator for Genetic Algorithms. PhD Thesis, Facultad de Informática, Universidad Politécnica de Madrid, Madrid (1991).
Eshelman, L. J., Schaffer, J. D.: Real-Coded Genetic Algorithms and Interval-Schemata. Foundations of Genetic Algorithms, 2 (1993).
Wright, A.: Genetic Algorithms for Real Parameter Optimization. Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA (1991) 205–218.
Radcliffe, N. J.: Genetic Neural Networks on MIMD Computers. PhD Dissertation, Dept. of Theoretical Phisics, University of Edinburgh, Edinburgh, UK (1990).
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.
Crespo, J.: Morphological Connected Filters and Intra-Region Smoothing for Image Segmentation. PhD thesis, Georgia Institute of Technology, Atlanta (1993).
D’Alotto, L. A., Giardina, C. R.: A Unified Signal Algebra Approach to Two-Dimensional Parallel Digital Signal Processing. Marcel Dekker, New York (1998).
González, R. C, Woods, R. E.: Digital Image Processing. Addison Wesley, New York, (1993).
Mars, P., Chen, J. R., Nambiar, R.: Learning Algorithms: Theory and Applications in Signal Processing, Control and Communications. CRC Press, New York (1996).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrios, D., Manrique, D., Porras, J., Ríos, J. (2000). Real-Coded Genetic Algorithms Based on Mathematical Morphology. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_73
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive
