A hybrid mutation chemical reaction optimization algorithm for global numerical optimization

DOI10.1155/2015/375902MaRDI QIDQ1665523zbMATH OpenOpenAlexWikidataFDO

Authors Ransikarn Ngambusabongsopa, Esraa Eldesouky, Zhi-Yong Li

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2015/375902

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Chemistry (92E99)

Review text

Summary: This paper proposes a hybrid metaheuristic approach that improves global numerical optimization by increasing optimal quality and accelerating convergence. This algorithm involves a recently developed process for chemical reaction optimization and two adjustment operators (turning and mutation operators). Three types of mutation operators (uniform, nonuniform, and polynomial) were combined with chemical reaction optimization and turning operator to find the most appropriate framework. The best solution among these three options was selected to be a hybrid mutation chemical reaction optimization algorithm for global numerical optimization. The optimal quality, convergence speed, and statistical hypothesis testing of our algorithm are superior to those previous high performance algorithms such as RCCRO, HP-CRO2, and OCRO.

Recommendations

• A novel hybrid bat algorithm with harmony search for global numerical optimization
• An advanced chemical reaction optimization algorithm based on balanced local and global search
• An Improved Particle Swarm Optimization Algorithm for Global Numerical Optimization
• A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
• Differential evolution algorithms using hybrid mutation

Cites work

• A sharper Bonferroni procedure for multiple tests of significance
• Evolutionary programming based on non-uniform mutation
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3059478 (Why is no real title available?)
• Multiple Comparisons Among Means
• Non-uniform mutation rates for problems with unknown solution lengths
• On the disruption-level of polynomial mutation for evolutionary multi-objective optimisation algorithms

Cited in

(4)

• An advanced chemical reaction optimization algorithm based on balanced local and global search
• A new effective operator for the hybrid algorithm for solving global optimisation problems
• A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
• Chemo-inspired genetic algorithm for function optimization

This page was built for publication: A hybrid mutation chemical reaction optimization algorithm for global numerical optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665523)