An algebraic approach to population-based evolutionary algorithm generation
From MaRDI portal
Recommendations
- A framework for the description of evolutionary algorithms
- The algorithm for algorithms: an evolutionary algorithm based on automatic designing of genetic operators
- scientific article; zbMATH DE number 1305070
- A taxonomy of evolutionary algorithms in combinatorial optimization
- A generic design model for evolutionary algorithms
Cites work
- scientific article; zbMATH DE number 46424 (Why is no real title available?)
- scientific article; zbMATH DE number 807132 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- A problem reduction based approach to discrete optimization algorithm design
- Essential concepts of algebraic specification and program development
- Evolution strategies. A comprehensive introduction
- Formal derivation of graph algorithmic programs using partition-and-recur
- Theory and Applications of Models of Computation
- Toward an Automatic Approach to Greedy Algorithms
Cited in
(6)- A knowledge-based approach to initial population generation in evolutionary algorithms: Application to the protein structure prediction problem
- A population-based algorithm-generator for real-parameter optimization
- A generic design model for evolutionary algorithms
- Computational Science - ICCS 2004
- The algorithm for algorithms: an evolutionary algorithm based on automatic designing of genetic operators
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
This page was built for publication: An algebraic approach to population-based evolutionary algorithm generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2520618)