Heuristic manipulation, tabu search and frequency assignment.
Roberto MontemanniDerek H. SmithPublished in: Comput. Oper. Res. (2010)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- feasible solution
- heuristic methods
- search procedure
- vehicle routing problem
- search algorithm
- iterated local search
- benchmark instances
- memetic algorithm
- genetic algorithm
- test problems
- tabu search algorithm
- job shop scheduling problem
- path relinking
- scheduling problem
- variable neighborhood search
- variable neighbourhood search
- quadratic assignment problem
- initial solution
- multidimensional knapsack problem
- multi start
- simulated annealing and tabu search
- hybrid algorithm
- graph colouring
- combinatorial optimization
- hill climbing
- optimization problems
- test instances
- search space
- scatter search
- neural network
- optimal solution
- evolutionary algorithm
- multi objective
- dynamic programming
- ant colony optimization
- search heuristics
- search strategy
- max sat
- solution quality
- routing problem
- combinatorial optimization problems