A GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem
Gerald PaulPublished in: CoRR (2012)
Keyphrases
- quadratic assignment problem
- simulated annealing
- tabu search
- gpu implementation
- combinatorial optimization
- metaheuristic
- real time
- solution quality
- evolutionary algorithm
- feasible solution
- genetic algorithm
- traveling salesman
- benchmark instances
- benchmark problems
- test instances
- memetic algorithm
- genetic algorithm ga
- job shop scheduling problem
- test problems
- feature tracking
- lower bound
- max sat
- neural network
- vehicle routing problem
- graphics processing units
- search algorithm
- traveling salesman problem
- exact algorithms
- general purpose
- optical flow
- aco algorithm
- computational complexity
- branch and bound algorithm
- optimal solution