Parallel Chemical Reaction Optimization for the Quadratic Assignment Problem

Chemical Reaction Optimization (CRO), a recently proposed metaheuristic, has demonstrated its capability in solving NP-hard optimization problems. CRO is a population-based evolutionary technique inspired by the interactions between molecules in a chemical reaction. In this paper, we present a parallel version of CRO (named PCRO) with a synchronous communication strategy. PCRO is applied to solve the Quadratic Assignment Problem (QAP), which is considered one of the great challenges in combinatorial optimization. Simulation results show that compared with the sequential CRO, our proposed PCRO can not only reduce the computation time but also improve the quality of the solution for instances of QAP with large sizes.

[1]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

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

[3]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  C. Siva Ram Murthy,et al.  A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[6]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[7]  Yoshikazu Fukuyama,et al.  Parallel genetic algorithm for generation expansion planning , 1996 .

[8]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[9]  Victor O. K. Li,et al.  Chemical-Reaction-Inspired Metaheuristic for Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[10]  Victor O. K. Li,et al.  Chemical Reaction Optimization for the Grid Scheduling Problem , 2010, 2010 IEEE International Conference on Communications.

[11]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[12]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[13]  D. Janaki Ram,et al.  Distributed simulated annealing algorithms for job shop scheduling , 1995, IEEE Trans. Syst. Man Cybern..

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

[15]  Victor O. K. Li,et al.  Chemical Reaction Optimization for population transition in peer-to-peer live streaming , 2010, IEEE Congress on Evolutionary Computation.

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  Manuel Laguna,et al.  Tabu Search , 1997 .

[18]  Kevin D. Seppi,et al.  Parallel PSO using MapReduce , 2007, 2007 IEEE Congress on Evolutionary Computation.

[19]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[20]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..