Abstract
Genetic Algorithms are non-deterministic, stochastic-search adaptive methods which use the theories of natural evolution and selection in order to solve a problem within a complex range of possible solutions. The aim is to control the distribution of the search space by incorporating an exhaustive method in order to maintain a constant evolution of the population. The main goal is that of redesigning the algorithm in order to add to the classic genetic algorithm method those characteristics which favour exhaustive search methods. The method explained guarantees the achievement of reasonably satisfactory solutions in short time-spans and in a deterministic way, which entails that successive repetitions of the algorithm will achieve the same solutions in almost constant time-spans. We are, therefore, dealing with an evolutionary technique which makes the most of the characteristics of genetic algorithms and exhaustive methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland J., ”Adaptation in Natural and Artificial Systems”, University of Michigan Press, Ann Arbor, 1975
Goldberg, D.E., ”Genetic Algorithms in search, optimization and machine learning”, Addison-Wesley, Reading, Massachusetts, 1989.
Morrow M., ”Genetic Algorithms a new class of Searching Algorithms”, Dr. Dobbb’s Journal, April 1991.
Bäck, T., ”Evolutionary Algorithms in Theory and Practice”. Ed. Oxford University Press. 1996.
Bramlette M.F., ”Initialization, Mutation and Selection Methods in Genetic Algorithms for Function Optimization”. Proceedings of the Fourth International Conference on Genetic Algorithms. Ed. Morgan Kaufmann. Eds. R.K. Belew & L.B. Booker. Pp. 100–107. 1991.
Bethke, A.D., ”Genetic Algorithms and Function Optimizers”. Thesis. University of Michigan. 1981.
Kumar, A., Morris, A., ”A hybrid evolutionary algorithm for global optimisation”, GECCO-2000, Las Vegas, Nevada, July, 2000.
Liang K.-H., Yao X., Newton, C., ”Evolutionary search of approximated N-dimensional landscapes” Int. Journal of Knowledge-Based Intelligent Engineering Systems, (3):172–183, July 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dorado, J., Santos, A., Rabuñal, J.R., Pedreira, N., Pazos, A. (2001). Hybrid Two-Population Genetic Algorithm. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4_47
Download citation
DOI: https://doi.org/10.1007/3-540-45493-4_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42732-2
Online ISBN: 978-3-540-45493-9
eBook Packages: Springer Book Archive