Abstract: In the area of combinatorial optimization, the Quadratic Assignment Problem stands out due to its complexity and its range of applications.
In this paper, PMSA (Parallel Multistart Simulated Annealing) was developed on GPU by using CUDA platform to solve QAP (Quadratic Assignment Problem). The ...
Aug 1, 2018 · Nowadays developing parallel algorithms on GPU becomes very important. In this paper, NP-Hard Quadratic Assignment Problem (QAP) that is one of ...
In this paper we present a generalization of the sequential simulated annealing algorithm for combinatorial optimization problems. By performing a parallel ...
This work describes an SA implementation for the quadratic assignment problem which runs on a graphics processing unit (GPU). The quadratic assignment ...
Missing: Approach | Show results with:Approach
J.-C. Wang, A multistart simulated annealing algorithm for the quadratic assignment problem, in: Innovations in Bio-Inspired Computing and Applications (IBICA), ...
Aug 13, 2012 · Abstract:The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. An effective heuristic for ...
In this paper, we solve the QAP problem using a parallel algorithm that employs ... S(2018)A cooperative GPU-based Parallel Multistart Simulated Annealing ...
Combinatorial optimization NP-Hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU.
Abstract- In this study, quadratic assignment problem, which is a hard combinatorial optimization problem, is examined to solve by a new approach.