Abstract
This paper presents a Particle Swarm Optimization (PSO) algorithm for the Quadratic Assignment Problem (QAP) implemented on OpenCL platform. Motivations to our work were twofold: firstly we wanted to develop a dedicated algorithm to solve the QAP showing both time and optimization performance, secondly we planned to check, if the capabilities offered by popular GPUs can be exploited to accelerate hard optimization tasks requiring high computational power. We were specifically targeting low-cost popular devices, with limited capabilities. The paper discusses the algorithm and its parallel implementation, as well as reports results of tests.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bermudez, R., Cole, M.H.: A genetic algorithm approach to door assignments in breakbulk terminals. Tech. Rep. MBTC-1102, Mack-Blackwell Transportation Center, University of Arkansas, Fayetteville, Arkansas (2001)
Burkard, R., Karisch, S., Rendl, F.: Qaplib-a quadratic assignment problem library. Journal of Global Optimization 10(4), 391–403 (1997)
Burkard, R., Karisch, S., Rendl, F.: QAPLIB a Quadratic Assignment Problem library. Journal of Global Optimization 10(4), 391–403 (1997)
Chmiel, W.: Evolution Algorithms for optimisation of task assignment problem with quadratic cost function. Ph.D. thesis, AGH Technology University, Poland (2004)
Chmiel, W., Kadłuczka, P., Packanik, G.: Performance of swarm algorithms for permutation problems. Automatyka 15(2), 117–126 (2009)
Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 219–239. Springer, Heidelberg (2004)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39–43 (October 1995)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Grötschel, M.: Discrete mathematics in manufacturing. In: Malley, R.E.O. (ed.) ICIAM 1991: Proceedings of the Second International Conference on Industrial and Applied Mathematics, pp. 119–145. SIAM (1991)
Howes, L., Munshi, A.: Aparapi - AMD, http://developer.amd.com/tools-and-sdks/opencl-zone/aparapi/ (last accessed: January 2015)
Howes, L., Munshi, A.: The OpenCL specification, https://www.khronos.org/registry/cl/specs/opencl-2.0.pdf (last accessed: January 2015)
Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Liu, H., Abraham, A., Zhang, J.: A particle swarm approach to quadratic assignment problems. In: Saad, A., Dahal, K., Sarfraz, M., Roy, R. (eds.) Soft Computing in Industrial Applications. ASC, vol. 39, pp. 213–222. Springer, Heidelberg (2007)
Mason, A., Rönnqvist, M.: Solution methods for the balancing of jet turbines. Computers & OR 24(2), 153–167 (1997)
Onwubolu, G.C., Sharma, A.: Particle swarm optimization for the assignment of facilities to locations. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 567–584. Springer, Heidelberg (2004)
Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. Journal of Global Optimization 4, 229–241 (1994)
Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555–565 (1976)
Stone, J.E., Gohara, D., Shi, G.: Opencl: A parallel programming standard for heterogeneous computing systems. Computing in Science & Engineering 12(3), 66 (2010)
Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3(2), 87–105 (1995)
Ugi, I., Bauer, J., Brandt, J., Friedrich, J., Gasteiger, J., Jochum, C., Schubert, W.: Neue anwendungsgebiete fur computer in der chemie. Angewandte Chemie 91(2), 99–111 (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Szwed, P., Chmiel, W., Kadłuczka, P. (2015). OpenCL Implementation of PSO Algorithm for the Quadratic Assignment Problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9120. Springer, Cham. https://doi.org/10.1007/978-3-319-19369-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-19369-4_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19368-7
Online ISBN: 978-3-319-19369-4
eBook Packages: Computer ScienceComputer Science (R0)