Diversification strategies in tabu search algorithms for the maximum clique problem.
Patrick SorianoMichel GendreauPublished in: Ann. Oper. Res. (1996)
Keyphrases
- tabu search
- search algorithm
- benchmark instances
- search strategies
- search procedure
- search heuristics
- metaheuristic
- simulated annealing
- feasible solution
- memetic algorithm
- tabu search algorithm
- scheduling problem
- heuristic search
- search space
- branch and bound
- search strategy
- vehicle routing problem
- branch and bound algorithm
- job shop scheduling problem
- search methods
- selection strategies
- selection algorithm
- real time
- search problems
- reinforcement learning
- neural network