An Evolutionary Metagraph Approach for Solving Problems in Complex Subject Areas

Created by W.Langdon from gp-bibliography.bib Revision:1.8415

@InProceedings{Nardid:2025:REEPE,

• author = "Anatoly N. Nardid and Stepan S. Vinnikov and Alexey V. Orazov and Yuriy E. Gapanyuk",
• title = "An Evolutionary Metagraph Approach for Solving Problems in Complex Subject Areas",
• booktitle = "2025 7th International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)",
• year = "2025",
• month = apr,
• keywords = "genetic algorithms, genetic programming, cartesian genetic programming, CGP, linear genetic programming, LGP, Power engineering, Directed acyclic graph, Evolutionary computation, Benchmark testing, Reproducibility of results, Complexity theory, Standards, metagraphs, evolutionary algorithms, directed acyclic graphs (DAGs))",
• ISSN = "2831-7262",
• DOI = "doi:10.1109/REEPE63962.2025.10970829",
• abstract = "This paper explores the integration of metagraphs with genetic programming (GP), offering a novel perspective aimed at overcoming the limitations of traditional graph-based approaches. Metagraphs, providing an advanced abstraction over standard graphs, are examined for their potential to more efficiently encapsulate complex relationships and hierarchical structures. The focus is on how metagraphs can contribute to evolutionary algorithms by enriching the representation of problem spaces, potentially leading to improved adaptability and precision in solutions. We discuss the initial theoretical insights and potential benefits of this integration, positioning metagraphs as a promising tool for enhancing the effectiveness of evolutionary strategies. This exploration is intended to pave new research pathways in GP, proposing that metagraphs hold the potential to significantly augment the outcomes of evolutionary processes.",
• notes = "Also known as \cite{10970829}",

}

Genetic Programming entries for Anatoly N Nardid Stepan S Vinnikov Alexey V Orazov Yuriy E Gapanyuk

Citations