DocumentCode
1357317
Title
Chemical-Reaction-Inspired Metaheuristic for Optimization
Author
Lam, Albert Y S ; Li, Victor O K
Author_Institution
Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong, China
Volume
14
Issue
3
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
381
Lastpage
399
Abstract
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.
Keywords
chemical reactions; combinatorial mathematics; computational complexity; optimisation; chemical reaction optimization; low energy stable state; metaheuristic; no-free-lunch theorem; nondeterministic polynomial-time hard combinatorial optimization; Chemical reaction; metaheuristics; nature-inspired algorithms; optimization methods;
fLanguage
English
Journal_Title
Evolutionary Computation, IEEE Transactions on
Publisher
ieee
ISSN
1089-778X
Type
jour
DOI
10.1109/TEVC.2009.2033580
Filename
5353674
Link To Document