Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems.
Hugo Terashima-MarínArmando Moran-SaavedraPeter RossPublished in: Congress on Evolutionary Computation (2005)
Keyphrases
- cutting stock problems
- hyper heuristics
- timetabling problem
- examination timetabling
- graph coloring
- multiple objectives
- evolutionary algorithm
- genetic programming
- genetic algorithm
- search heuristics
- constraint satisfaction problems
- difficult problems
- metaheuristic
- heuristic search
- memetic algorithm
- search procedure
- combinatorial optimization
- evolutionary computation
- condition action rules
- heuristic methods
- search strategies
- search strategy
- power system
- search algorithm