Solving the Quadratic Assignment Problem (QAP) Through a Fine-Grained Parallel Genetic Algorithm Implemented on GPUs.
Roberto PovedaJonatan GómezPublished in: ICCCI (2) (2018)
Keyphrases
- quadratic assignment problem
- fine grained
- parallel genetic algorithm
- combinatorial optimization
- coarse grained
- stochastic local search
- lower bound
- tabu search
- access control
- massively parallel
- branch and bound algorithm
- simulated annealing
- metaheuristic
- neural network
- genetic algorithm
- traveling salesman problem
- satisfiability problem
- machine learning