Local Search Guided by Path Relinking and Heuristic Bounds.
Joseph M. PasiaXavier GandibleuxKarl F. DoernerRichard F. HartlPublished in: EMO (2006)
Keyphrases
- path relinking
- tabu search
- search procedure
- multi start
- variable neighborhood descent
- neighborhood search
- metaheuristic
- grasp with path relinking
- simulated annealing
- combinatorial optimization
- scatter search
- iterated local search
- greedy randomized adaptive search procedure
- memetic algorithm
- search algorithm
- scheduling problem
- feasible solution
- heuristic methods
- nature inspired
- variable neighborhood search
- max min
- job shop scheduling problem
- lower bound
- initial solution
- upper bound
- hill climbing
- test problems
- genetic algorithm
- search space
- benchmark instances
- traveling salesman problem
- tabu search algorithm
- search procedures
- search heuristics
- benchmark problems
- routing problem
- dynamic programming
- vehicle routing problem
- global optimization
- optimal solution
- solution quality
- evolutionary algorithm
- hybrid metaheuristic
- search strategy
- solution space
- branch and bound
- special case
- multi objective