ACM Home Page
Please provide us with feedback. Feedback
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Full text PdfPdf (850 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers table of contents
Montreal, Québec, Canada
WORKSHOP SESSION: Computational intelligence on consumer games and graphics hardware (CIGPU) 2009 table of contents
Pages 2523-2530  
Year of Publication: 2009
ISBN:978-1-60558-505-5
Authors
Shigeyoshi Tsutsui  Hannan University, Matsubara, Japan
Noriyuki Fujimoto  Osaka Prefecture University, Sakai, Japan
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 45,   Downloads (12 Months): 94,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1570256.1570355
What is a DOI?

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 multiple-population, 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 were taken from the QAPLIB benchmark library. Results were promising, showing a speedup ration from 3 to 12 times, compared to the Intel i7 965 processor.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
QAPLIB -- a quadratic assignment problem library, 2009. http://www.seas.upenn.edu/qaplib.
 
2
W. Banzhaf, S. Harding, W. Langdon, and G. Wilson. Accelerating Genetic Programming through Graphics Processing Units. Springer, 2008.
 
3
4
 
5
 
6
N. Fujimoto. Dense matrix-vector multiplication on the CUDA architecture. Parallel Processing Letters, 18(4), 2008.
 
7
N. Fujimoto. Faster matrix-vector multiplication on GeForce 8800GTX. In Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2008.
 
8
 
9
S. Grauer-Gray, C. Kambhamettu, and K. Palaniappan. Gpu implementation of belief propagation using cuda for cloud tracking and reconstruction. In Proceedings of the 5th IAPR Workshop on Pattern Recognition in Remote Sensing (PRRS), 2008.
 
10
K. Gulati and S. Khatri. In Proceedings of the 2009 Conference on Asia and South Pacific Design Automation, 2009.
11
 
12
T. Koopmans and M. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25, 1957.
 
13
S. Lahabar and P. Narayanan. Singular value decomposition on gpu using cuda. In Proceedings of the IEEE International Parallel & Distributed Processing Symposium (IPDPS), (to appear), 2009.
 
14
W. Langdon and W. Banzhaf. A simd interpreter for genetic programming on gpu graphics cards. In Proceedings of the 11th European Conference on Genetic Programming. Springer, 2008.
 
15
 
16
 
17
Y. Liu, E. Zhang, and X. Shen. A cross-input adaptive framework for gpu programs optimization. In Proceedings of the IEEE International Parallel & Distributed Processing Symposium (IPDPS) (to appear), 2009.
 
18
P. Maciol and K. Banas. Testing tesla architecture for scientific computing: The performance of matrix-vector product. In Proceedings of the International Multiconference on Computer Science and Information Technology, 2008.
 
19
 
20
S. Manavski. Cuda compatible gpu as an efficient hardware accelerator for cryptography. In Proceedings of the IEEE International Conference on Signal Processing and Communication (ICSPC 2007), 2007.
 
21
 
22
 
23
NVIDIA, 2009. http://www.nvidia.com/page/home.html.
 
24
I. Oliver, D. Smith, and J. Holland. A study of permutation crossover operators on the travel salesman problem. In Proceedings of the 2nd International Conference on Genetic Algorithms. L. Erlbaum Associates Inc., 1987.
25
 
26
D. Robilliard, V. Marion-Poty, and C. Fonlupt. Population parallel gp on the g80 gpu. In Proceedings of the 11th European Conference on Genetic Programming. Springer, 2008.
27
28
 
29
 
30
É. Taillard. taboo search code. 2004. http://mistic.heig-vd.ch/taillard/codes.dir/tabou_qap.cpp.
 
31
 
32
 
33
G. Wilson and W. BanzhafLinear. Linear genetic programming gpgpu on microsoft's xbox 360. In Proceedings of the IEEE Congress on Evolutionary Computation 2008 (CEC'08), 2008.
 
34
M. Wong and T. Wong. Parallel hybrid genetic algorithms on consumer-level graphics hardware. In Proceedings of IEEE Congress on Evolutionary Computation 2006 (CEC'06), 2006.

Collaborative Colleagues:
Shigeyoshi Tsutsui: colleagues
Noriyuki Fujimoto: colleagues