Bounds for short covering codes and reactive tabu search.
Carlos MendesEmerson L. Monte CarmeloMarcus PoggiPublished in: Discret. Appl. Math. (2010)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- scheduling problem
- search procedure
- feasible solution
- path relinking
- upper bound
- memetic algorithm
- heuristic methods
- hybrid algorithm
- lower bound
- tabu search algorithm
- quadratic assignment problem
- iterated local search
- search algorithm
- genetic algorithm
- test problems
- vehicle routing problem
- job shop scheduling problem
- multi start
- multidimensional knapsack problem
- scatter search
- worst case
- initial solution
- candidate list
- tabu list
- job shop
- benchmark instances
- flowshop
- variable neighborhood search
- max sat
- combinatorial optimization
- graph colouring
- optimal solution