Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems.
Ricardo N. LiangEduardo A. J. AnacletoCláudio N. MenesesPublished in: J. Heuristics (2022)
Keyphrases
- tabu search
- metaheuristic
- optimization problems
- combinatorial optimization
- data structure
- objective function
- simulated annealing
- path relinking
- evolutionary algorithm
- ant colony optimization
- scatter search
- search algorithm for solving
- feasible solution
- search heuristics
- test problems
- memetic algorithm
- vehicle routing problem
- iterated local search
- combinatorial optimization problems
- quadratic assignment problem
- traveling salesman problem
- tabu search algorithm
- search procedure
- benchmark instances
- initial solution
- job shop scheduling problem
- combinatorial problems
- heuristic methods
- search algorithm
- genetic algorithm
- cost function
- mip solver
- scheduling problem
- knapsack problem
- search space
- solution space
- hybrid algorithm
- candidate list
- max sat
- optimal solution
- multi start
- graph colouring
- computational complexity
- particle swarm optimization
- branch and bound
- tabu list
- neural network
- mixed integer program
- variable neighborhood search