Homogeneous genetic algorithms
From MaRDI portal
Publication:5852153
DOI10.1080/00207160801968770zbMath1181.90295OpenAlexW2054321424MaRDI QIDQ5852153
Publication date: 26 January 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160801968770
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Uses Software
Cites Work
- Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Finding a Maximum Independent Set
- CF-GGA: A grouping genetic algorithm for the cell formation problem
- Genetic algorithm to solve the p-centre and p-radius problem on a network
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Homogeneous genetic algorithms