Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers 2009
DOI: 10.1145/1570256.1570355
|View full text |Cite
|
Sign up to set email alerts
|

Solving quadratic assignment problems by genetic algorithms with GPU computation

Abstract: This paper describes designing a parallel GA with GPU computation to solve the quadratic assignment problem (QAP) which is one of the hardest optimization problems in permutation domains. For the parallel method, a multiplepopulation, coarse-grained GA model was used. Each subpopulation is evolved by a multiprocessor in a GPU (NVIDIA GeForce GTX285). At predetermined intervals of generations all individuals in subpopulations are shuffled via the VRAM of the GPU. The instances on which this algorithm was tested… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(31 citation statements)
references
References 28 publications
0
30
0
Order By: Relevance
“…Real life like instances and randomly generated instances of the QAPLIB library whose size ranges from 50 to 150 have been considered. Speedups of 24.6 times have been observed as compared with a sequential version of the method implemented on the CPU (reference is also made to [41]). …”
Section: B Scheduling Problems 1) Branch and Boundmentioning
confidence: 99%
“…Real life like instances and randomly generated instances of the QAPLIB library whose size ranges from 50 to 150 have been considered. Speedups of 24.6 times have been observed as compared with a sequential version of the method implemented on the CPU (reference is also made to [41]). …”
Section: B Scheduling Problems 1) Branch and Boundmentioning
confidence: 99%
“…Tsutsui et al [41] propose run a coarse-grained GA on GPU to solve the quadratic assignment problem (QAP) using CUDA. This is one of the hardest optimization problems in permutation domains.…”
Section: Coarse-grained Approaches (Island Model)mentioning
confidence: 99%
“…Tsutsui et al [22] propose run a coarse-grained GA on GPU to solve the quadratic assignment problem (QAP) using CUDA. This is one of the hardest optimization problems in permutation domains.…”
Section: Coarse-grained Approaches (Island Model)mentioning
confidence: 99%