An extension of adaptive multi-start tabu search for the maximum quasi-clique problem.
Youcef DjeddiHacène Aït HaddadèneNabil BelacelPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- multi start
- tabu search
- iterated local search
- path relinking
- metaheuristic
- simulated annealing
- memetic algorithm
- scheduling problem
- genetic algorithm
- feasible solution
- search algorithm
- vehicle routing problem
- search procedure
- global optimization
- heuristic methods
- scatter search
- max sat
- benchmark instances
- tabu search algorithm
- stochastic approximation
- test problems
- dynamic programming
- vehicle routing problem with time windows
- search heuristics
- solution space
- linear program
- variable neighborhood search
- search strategies
- computational efficiency
- search strategy