A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem.
Kazuho KanaharaKengo KatayamaTakeshi OkanoElis KullaTetsuya OdaNoritaka NishiharaPublished in: CISIS (2018)
Keyphrases
- iterated local search
- tabu search
- benchmark instances
- metaheuristic
- multi start
- vehicle routing problem
- simulated annealing
- scheduling problem
- search algorithm
- path relinking
- search strategies
- feasible solution
- search strategy
- special case
- search space
- objective function
- max sat
- global optimization
- search heuristics
- constraint satisfaction
- vehicle routing problem with time windows
- variable neighborhood descent