Comparison of different tabu search operators on a highly constrained industrial problem.
David DuvivierOlivier RouxArnauld HansetPublished in: Int. J. Adv. Oper. Manag. (2009)
Keyphrases
- tabu search
- highly constrained
- simulated annealing
- metaheuristic
- feasible solution
- path relinking
- scheduling problem
- memetic algorithm
- test problems
- search algorithm
- vehicle routing problem
- job shop scheduling problem
- quadratic assignment problem
- initial solution
- benchmark instances
- heuristic methods
- genetic algorithm
- search procedure
- iterated local search
- multi start
- hybrid algorithm
- tabu search algorithm
- max sat
- multidimensional knapsack problem
- tabu list
- simulated annealing and tabu search
- scatter search
- cost function
- constrained problems
- solution space
- evolutionary algorithm
- candidate list
- objective function