THE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACE
From MaRDI portal
Publication:3636402
DOI10.1142/S0129183109013807zbMath1168.90491OpenAlexW2059055105MaRDI QIDQ3636402
Publication date: 30 June 2009
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129183109013807
Learning and adaptive systems in artificial intelligence (68T05) Search theory (90B40) Dynamic programming (90C39) Population dynamics (general) (92D25)
Cites Work
- Unnamed Item
- The dynamics of a genetic algorithm for simple random Ising systems
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Modeling genetic algorithms with Markov chains.
- The development of a changing range genetic algorithm
- Handling constraints using multiobjective optimization concepts
- MODELLING THE DYNAMICS OF AN ADJUSTMENT OF A SEARCH SPACE SIZE IN A GENETIC ALGORITHM
- Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment
- A changing range genetic algorithm
- A continuous genetic algorithm designed for the global optimization of multimodal functions
This page was built for publication: THE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACE