Chemical reaction optimization: survey on variants

被引:0
作者
Md. Rafiqul Islam
C. M. Khaled Saifullah
Md. Riaz Mahmud
机构
[1] Khulna University,Computer Science and Engineering Discipline
[2] University of Saskatchewan,Department of Computer Science
来源
Evolutionary Intelligence | 2019年 / 12卷
关键词
Optimization; Chemical Reaction Optimization; Meta-heuristic; NP-hard; Maximization; Minimization;
D O I
暂无
中图分类号
学科分类号
摘要
Chemical Reaction Optimization (CRO) is a recently established population based metaheuristic for optimization problems inspired by the natural behavior of chemical reactions . Optimization is a way of ensuring the usability of resources and related technologies in the best possible way. We experience optimization problems in our daily lives while some problems are so hard that we can, at best, approximate the best solutions with heuristic or metaheuristic methods. This search (CRO) algorithm inherits several features from other metaheuristics like Simulated Annealing and Genetic Algorithm. After its invention, it was successfully applied to various optimization problems that were solved by other metaheuristic algorithms . The robustness of CRO algorithm was proved when the comparisons with other evolutionary algorithms like Particle Swarm Optimization, Genetic Algorithm, Simulated Annealing, Ant Colony Optimization, Tabu Search, Bee Colony Optimization etc. showed the superior results. As a result, the CRO algorithm has been started to use for solving problems in different fields of optimization . In this paper, we have reviewed the CRO based algorithms with respect to some well-known optimization problems. A brief description of variants of CRO algorithm will help the readers to understand the diversified quality of CRO algorithm. For different problems where CRO algorithms were used, the study on parameters and the experimental results are included to show the robustness of CRO algorithm.
引用
收藏
页码:395 / 420
页数:25
相关论文
共 70 条
[1]  
Blum C(2005)Ant colony optimization: introduction and recent trends Phys Life Rev 2 353-373
[2]  
Shadbolt N(2004)Nature-inspired computing IEEE Intell Syst 19 2-3
[3]  
Garey MR(1979)Computers and intractability: a guide to the theory of np-completeness Revista Da Escola De Enfermagem Da USP 44 340-18
[4]  
Sörensen K(2015)Metaheuristics—the metaphor exposed Int Trans Oper Res 22 3-795
[5]  
Al-Salami NM(2009)Evolutionary algorithm definition Am J Eng Appl Sci 2 789-39
[6]  
Dorigo M(2006)Ant colony optimization—artificial ants as a computational intelligence technique IEEE Comput Intell Mag 1 28-257
[7]  
Birattari M(1995)Optimization using simulated annealing The Statistician 44 241-399
[8]  
Stützle T(2010)Chemical-reaction-inspired metaheuristic for optimization IEEE Trans Evolut Comput 14 381-1631
[9]  
Brooks SP(2011)Chemical reaction optimization for task scheduling in grid computing IEEE Trans Parallel Distrib Syst 22 1624-1780
[10]  
Morgan BJ(2013)Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem Appl Soft Comput 13 1774-1322