IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/96-07-046.html
   My bibliography  Save this paper

The Algebraic Theory of Recombination Spaces

Author

Listed:
  • Peter F. Stadler
  • Gunjter P. Wagner

Abstract

A new mathematical representaion is proposed for the configuration space structure induced by recombination which we called "P-structure." It consists of a mapping of pairs of objects to the power set of all objects in the search space. The mapping assigns to each pair of parental "genotypes" the set of all recombinant genotypes obtainable from the parental ones. It is shown that this construction allows a Fourier-decomposition of fitness landscapes into a superposition of "elementary landscapes." This decomposition is analogous to the Fourier decomposition of fitness landscapes on mutation spaces. The elementary landscapes are obtained as eigenfunctions of a Laplacian operator defined for P-structures. For binary string recombination the elementary landscapes are exactly the p-spin functions (Walsh functions), i.e., the same as the elementary landscapes of the string point mutation spaces (i.e., the hypercube). This supports the notion of a strong homomorphisms between string mutation and recombination spaces. However, the effective nearest neighbor correlations on these elementary landscapes differ between mutation and recombination and among different recombination operators. On average, the nearest neighbor correlation is higher for one-point recombination than for uniform recombination. For one-point recombination the correlations are higher for elementary landscapes with fewer interacting sites as well as for sites which have closer linkage, confirming the qualitative predictions of the Schema-Theorem. We conclude that the algebraic approach to fitness landscape analysis can be extended to recombination spaces and provides an effective way to analyze the relative hardness of a landscape for a given recombination operator.

Suggested Citation

  • Peter F. Stadler & Gunjter P. Wagner, 1996. "The Algebraic Theory of Recombination Spaces," Working Papers 96-07-046, Santa Fe Institute.
  • Handle: RePEc:wop:safiwp:96-07-046
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Barbel Krakhofer & Peter F. Stadler, 1996. "Local Minima in the Graph Bipartitioning Problem," Working Papers 96-02-005, Santa Fe Institute.
    2. Terry Jones, 1995. "Evolutionary Algorithms, Fitness Landscapes and Search," Working Papers 95-05-048, Santa Fe Institute.
    3. Wim Hordijk, 1995. "A Measure of Landscapes," Working Papers 95-05-049, Santa Fe Institute.
    4. David H. Wolpert & William G. Macready, 1995. "No Free Lunch Theorems for Search," Working Papers 95-02-010, Santa Fe Institute.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gunter P. Wagner & Peter F. Stadler, 1997. "Complex Adaptations and the Structure of Recombination Spaces," Working Papers 97-03-029, Santa Fe Institute.
    2. Christian M. Reidys & Peter F. Stadler, 1998. "Neutrality in Fitness Landscapes," Working Papers 98-10-089, Santa Fe Institute.
    3. Koen Frenken & Luigi Marengo & Marco Valente, 1999. "Interdependencies, nearly-decomposability and adaption," CEEL Working Papers 9903, Cognitive and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
    4. Jui-Sheng Chou & Dinh-Nhat Truong & Chih-Fong Tsai, 2021. "Solving Regression Problems with Intelligent Machine Learner for Engineering Informatics," Mathematics, MDPI, vol. 9(6), pages 1-25, March.
    5. Sevvandi Kandanaarachchi & Mario A Munoz & Rob J Hyndman & Kate Smith-Miles, 2018. "On normalization and algorithm selection for unsupervised outlier detection," Monash Econometrics and Business Statistics Working Papers 16/18, Monash University, Department of Econometrics and Business Statistics.
    6. Kamran Zolfi, 2023. "Gold rush optimizer: A new population-based metaheuristic algorithm," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(1), pages 113-150.
    7. William G. Macready & David H. Wolpert, 1995. "What Makes an Optimization Problem Hard?," Working Papers 95-05-046, Santa Fe Institute.
    8. Y.C. Ho & D.L. Pepyne, 2002. "Simple Explanation of the No-Free-Lunch Theorem and Its Implications," Journal of Optimization Theory and Applications, Springer, vol. 115(3), pages 549-570, December.
    9. Murtadha Al-Kaabi & Virgil Dumbrava & Mircea Eremia, 2022. "A Slime Mould Algorithm Programming for Solving Single and Multi-Objective Optimal Power Flow Problems with Pareto Front Approach: A Case Study of the Iraqi Super Grid High Voltage," Energies, MDPI, vol. 15(20), pages 1-33, October.
    10. Galioto, Francesco & Battilani, Adriano, 2021. "Agro-economic simulation for day by day irrigation scheduling optimisation," Agricultural Water Management, Elsevier, vol. 248(C).
    11. Peter F. Stadler & Robert Happel, 1995. "Random Field Models for Fitness Landscapes," Working Papers 95-07-069, Santa Fe Institute.
    12. Abdel-Rahman Hedar & Emad Mabrouk & Masao Fukushima, 2011. "Tabu Programming: A New Problem Solver Through Adaptive Memory Programming Over Tree Data Structures," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 10(02), pages 373-406.
    13. Terry Jones & Stephanie Forrest, 1995. "Genetic Algorithms and Heuristic Search," Working Papers 95-02-021, Santa Fe Institute.
    14. Agarwal, Anurag & Colak, Selcuk & Eryarsoy, Enes, 2006. "Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach," European Journal of Operational Research, Elsevier, vol. 169(3), pages 801-815, March.
    15. Murtadha Al-Kaabi & Virgil Dumbrava & Mircea Eremia, 2022. "Single and Multi-Objective Optimal Power Flow Based on Hunger Games Search with Pareto Concept Optimization," Energies, MDPI, vol. 15(22), pages 1-31, November.
    16. Hend Bouziri & Khaled Mellouli & El-Ghazali Talbi, 2011. "The k-coloring fitness landscape," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 306-329, April.
    17. Muangkote, Nipotepat & Sunat, Khamron & Chiewchanwattana, Sirapat & Kaiwinit, Sirilak, 2019. "An advanced onlooker-ranking-based adaptive differential evolution to extract the parameters of solar cell models," Renewable Energy, Elsevier, vol. 134(C), pages 1129-1147.
    18. Bill McKelvey, 1999. "Avoiding Complexity Catastrophe in Coevolutionary Pockets: Strategies for Rugged Landscapes," Organization Science, INFORMS, vol. 10(3), pages 294-321, June.
    19. David Kane, 1996. "Local Hillclimbing on an Economic Landscape," Working Papers 96-08-065, Santa Fe Institute.
    20. William G. Macready & David H. Wolpert, 1996. "On 2-Armed Gaussian Bandits and Optimization," Working Papers 96-03-009, Santa Fe Institute.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:96-07-046. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.