General swap-based multiple neighborhood tabu search for the maximum independent set problem.
Yan JinJin-Kao HaoPublished in: Eng. Appl. Artif. Intell. (2015)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- memetic algorithm
- feasible solution
- scheduling problem
- path relinking
- special case
- genetic algorithm
- vehicle routing problem
- test problems
- benchmark instances
- tabu search algorithm
- quadratic assignment problem
- job shop scheduling problem
- search algorithm
- heuristic methods
- search procedure
- hybrid algorithm
- iterated local search
- max sat
- multidimensional knapsack problem
- multi start
- tabu list
- initial solution
- flowshop
- random walk
- objective function