A survey of repair methods used as constraint handling techniques in evolutionary algorithms
DOI10.1016/j.cosrev.2009.07.001zbMath1301.90100OpenAlexW2074084152MaRDI QIDQ458493
Publication date: 7 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2009.07.001
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Neural networks for/in biological studies, artificial life and related topics (92B20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- An introduction to timetabling
- A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
- A hybrid grouping genetic algorithm for the cell formation problem
- A fast algorithm for Steiner trees
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- A genetic approach to the quadratic assignment problem
- Genetic algorithm crossover operators for ordering applications
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Evolutionary optimization.
- An efficient constraint handling method for genetic algorithms
- Recent research directions in automated timetabling
- Hard handoff minimization using genetic algorithms
- Evolution strategies. A comprehensive introduction
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university
- Guided local search and its application to the traveling salesman problem
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- A portable and scalable algorithm for a class of constrained combinatorial optimization problems
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Constraint handling in genetic algorithms using a gradient-based repair method
- Genetic algorithm and graph partitioning
- CF-GGA: A grouping genetic algorithm for the cell formation problem
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Neural networks and physical systems with emergent collective computational abilities.
- RELIABLE COMMUNICATION NETWORK DESIGN WITH EVOLUTIONARY ALGORITHMS
- Network design techniques using adapted genetic algorithms
- Guided genetic algorithm and its application to radio link frequency assignment problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item