Chemical-Reaction-Inspired Metaheuristic for Optimization

We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-) heuristic methods. However, the huge number of optimization problems and the small number of generally acknowledged methods mean that more metaheuristics are needed to fill the gap. We propose a new metaheuristic, called chemical reaction optimization (CRO), to solve optimization problems. It mimics the interactions of molecules in a chemical reaction to reach a low energy stable state. We tested the performance of CRO with three nondeterministic polynomial-time hard combinatorial optimization problems. Two of them were traditional benchmark problems and the other was a real-world problem. Simulation results showed that CRO is very competitive with the few existing successful metaheuristics, having outperformed them in some cases, and CRO achieved the best performance in the real-world problem. Moreover, with the No-Free-Lunch theorem, CRO must have equal performance as the others on average, but it can outperform all other metaheuristics when matched to the right problem type. Therefore, it provides a new approach for solving optimization problems. CRO may potentially solve those problems which may not be solvable with the few generally acknowledged approaches.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

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

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

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

[6]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[7]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[10]  David Connolly An improved annealing scheme for the QAP , 1990 .

[11]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[12]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[13]  S Forrest,et al.  Genetic algorithms , 1996, CSUR.

[14]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[15]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[16]  T. Peng,et al.  Simulated annealing for the quadratic assignment problem: A further study , 1996 .

[17]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[18]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[19]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

[21]  Victor O. K. Li,et al.  Fixed channel assignment in cellular radio networks using a modified genetic algorithm , 1998 .

[22]  Éric D. Taillard,et al.  FANT: Fast ant system , 1998 .

[23]  Hui Zhang,et al.  Image segmentation using evolutionary computation , 1999, IEEE Trans. Evol. Comput..

[24]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

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

[26]  Konstantinos G. Margaritis,et al.  On benchmarking functions for genetic algorithms , 2001, Int. J. Comput. Math..

[27]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[28]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[29]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[30]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[31]  Alex Alves Freitas,et al.  Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..

[32]  Y. Ho,et al.  Simple Explanation of the No-Free-Lunch Theorem and Its Implications , 2002 .

[33]  Alfonsas Misevicius,et al.  A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem , 2003, Informatica.

[34]  Rolf H. Möhring,et al.  Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..

[35]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[36]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[37]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[38]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[39]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[40]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[41]  Jiunn-Chin Wang Solving quadratic assignment problems by a tabu based simulated annealing algorithm , 2007, 2007 International Conference on Intelligent and Advanced Systems.

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

[43]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[44]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[45]  Jing Cao,et al.  Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks , 2008, IEEE Transactions on Mobile Computing.

[46]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[47]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.