OpenCL Implementation of PSO Algorithm for the Quadratic Assignment Problem

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.

[1]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[2]  Godfrey C. Onwubolu,et al.  Particle Swarm Optimization for the Assignment of Facilities to Locations , 2004 .

[3]  John E. Stone,et al.  OpenCL: A Parallel Programming Standard for Heterogeneous Computing Systems , 2010, Computing in Science & Engineering.

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  Martin Grötschel,et al.  Discrete mathematics in manufacturing , 1992 .

[6]  M H Cole,et al.  A GENETIC ALGORITHM APPROACH TO DOOR ASSIGNMENTS IN BREAKBULK TERMINALS , 2001 .

[7]  Mikael Rönnqvist,et al.  Solution methods for the balancing of jet turbines , 1997, Comput. Oper. Res..

[8]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[9]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[10]  J. Ben Rosen,et al.  A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..

[11]  A. Abraham,et al.  A Particle Swarm Approach to Quadratic Assignment Problems , 2007 .

[12]  C. Jochum,et al.  Neue Anwendungsgebiete für Computer in der Chemie , 1979 .

[13]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[14]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[17]  Aaftab Munshi,et al.  The OpenCL specification , 2009, 2009 IEEE Hot Chips 21 Symposium (HCS).