The parameters setting of a changing range genetic algorithm
From MaRDI portal
Publication:2003477
DOI10.1007/s11047-014-9420-2zbMath1417.68197OpenAlexW1998614570MaRDI QIDQ2003477
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-014-9420-2
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- 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
- 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
- The dynamics of a changing range 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The parameters setting of a changing range genetic algorithm