Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms.
Edmund K. BurkeTimothy CurtoisMatthew R. HydeGraham KendallGabriela OchoaSanja PetrovicJosé Antonio Vázquez RodríguezMichel GendreauPublished in: IEEE Congress on Evolutionary Computation (2010)
Keyphrases
- hyper heuristics
- iterated local search
- general purpose
- search algorithm
- metaheuristic
- vehicle routing problem with time windows
- tabu search
- heuristic search
- search procedure
- search space
- search methods
- heuristic methods
- search heuristics
- multi start
- examination timetabling
- simulated annealing
- genetic programming
- evolutionary algorithm
- ant colony optimization
- timetabling problem
- path relinking
- genetic algorithm
- difficult problems
- constraint satisfaction problems
- scatter search
- cutting stock problems
- vehicle routing problem
- condition action rules
- optimization problems
- branch and bound
- optimal solution
- memetic algorithm
- search strategy
- combinatorial problems
- search tree
- combinatorial optimization
- hill climbing
- beam search
- particle swarm optimization
- tree search
- search procedures
- constraint satisfaction
- state space
- test problems
- monte carlo
- scheduling problem
- multi objective
- satisfiability problem
- neural network