Diversification-driven tabu search for unconstrained binary quadratic problems.
Fred W. GloverZhipeng LüJin-Kao HaoPublished in: 4OR (2010)
Keyphrases
- tabu search
- test problems
- simulated annealing
- metaheuristic
- heuristic methods
- feasible solution
- search heuristics
- search algorithm
- path relinking
- graph colouring
- genetic algorithm
- multidimensional knapsack problem
- scheduling problem
- search algorithm for solving
- scatter search
- memetic algorithm
- vehicle routing problem
- search procedure
- optimization problems
- iterated local search
- combinatorial optimization
- tabu list
- hybrid algorithm
- job shop
- tabu search algorithm
- initial solution
- quadratic assignment problem
- benchmark instances
- job shop scheduling problem
- benchmark problems
- variable neighborhood search
- multi start
- max sat
- test instances
- solution quality
- np complete