Abstract
The application of a heuristic recombination operator to epistatic problems is discussed in this paper. This operator uses an A*-like mechanism to intelligently explore the dynastic potential (set of possible offspring) of recombined solutions, exploiting partial knowledge about the epistatic relation of variables. Two case studies (the design of a brachystochrone and the Rosenbrock function) are presented, providing experimental results. The scalability of the operator for increasing problem sizes is also considered.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Cotta, E. Alba, and J.M. Troya. Utilising dynastically optimal forma recombination in hybrid genetic algorithms. In A.E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature-PPSN V, volume 1498 of Lecture Notes in Computer Science, pages 305–314. Springer-Verlag, Berlin Heidelberg, 1998.
L.J. Fogel, A.J. Owens, and M.J. Walsh. Artificial Intelligence Through Simulated Evolution. Wiley, New York NY, 1966.
M. Herdy and G. Patone. Evolution strategy in action: 10 es-demonstrations. Technical Report TR-94-05, Technische Universität Berlin, 1994.
J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Harbor MI, 1975.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1992.
N.J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183–205, 1991.
N.J. Radcliffe. Forma analysis and random respectful recombination. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 222–229, San Mateo CA, 1991. Morgan Kaufmann.
N.J. Radcliffe. The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence, 10:339–384, 1994.
N.J. Radcliffe and P.D. Surry. Fundamental limitations of search algorithms: Evolutionary computing in perspective. In J. Van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 275–291. Springer-Verlag, 1995.
I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, 1973.
H.-P. Schwefel. Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of natural evolution. Annals of Operations Research, 1:165–167, 1984.
L.D. Whitley. Using reproductive evaluation to improve genetic search and heuristic discovery. In J.J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 116–121, Hillsdale NJ, 1987. Lawrence Erlbaum Associates.
D. H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotta, C., Troya, J.M. (1999). Tackling Epistatic Problems Using Dynastically Optimal Recombination. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive