Return
A cooperative GPU-based Parallel Multistart Simulated Annealing algorithm for Quadratic Assignment Problem
DOI:10.1016/j.jestch.2018.08.002.png)
Abstract
En 中文
GPU hardware and CUDA architecture provide a powerful platform to develop parallel algorithms. Implementation of heuristic and metaheuristic algorithms on GPUs are limited in literature. Nowadays developing parallel algorithms on GPU becomes very important. In this paper, NP-Hard Quadratic Assignment Problem (QAP) that is one of the combinatorial optimization problems is discussed. Parallel Multistart Simulated Annealing (PMSA) method is developed with CUDA architecture to solve QAP. An efficient method is developed by providing multistart technique and cooperation between threads. The cooperation is occurred with threads in both the same and different blocks. This paper focuses on both acceleration and quality of solutions. Computational experiments conducted on many Quadratic Assignment Problem Library (QAPLIB) instances. The experimental results show that PMSA runs up to 29x faster than a single-core CPU and acquires best known solution in a short time in many benchmark datasets. (C) 2018 Karabuk University. Publishing services by Elsevier B.V.
Keywords:
Combinatorial optimization
CUDA
GPU
Multistart Simulated Annealing
Parallel algorithms
Quadratic Assignment Problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
E
IF:
5.4
Papers:
1.4K
Citations:
6.3K
Organization
Cited Papers
Comparison of Kinetics, Toxicity, Oligomer Formation, and Membrane Binding Capacity of α-Synuclein Familial Mutations at the A53 Site, Including the Newly Discovered A53V Mutation
Biochemistry
IF0
Restoring T-helper 17 cell/regulatory T-cell balance and decreasing disease activity by rapamycin and all-trans retinoic acid in patients with systemic lupus erythematosus
Lupus
IF0

