The algebra of genetic algorithms
From MaRDI portal
Publication:1924788
DOI10.1007/BF01531276zbMath0855.68034OpenAlexW2142130292MaRDI QIDQ1924788
Publication date: 27 January 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531276
Related Items
A branching process model for genetic algorithms ⋮ On complexity of optimal recombination for flowshop scheduling problems ⋮ Evolutionary optimization: pitfalls and booby traps ⋮ Quasi-optimal recombination operator ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Information processing in transmitting recombination ⋮ Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem ⋮ Transit sets of two-point crossover ⋮ Transit sets of -point crossover operators ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Some results about the Markov chains associated to GPs and general EAs ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ Genetic search over probability spaces
Cites Work
- Genetic set recombination and its application to neural network topology optimisation.
- Generalizing the notion of schema in genetic algorithms
- Deception, dominance and implicit parallelism in genetic search.
- Modeling genetic algorithms with Markov chains.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The algebra of genetic algorithms
