Orthogonal chemical reaction optimization algorithm for global numerical optimization problems
•An improved chemical reaction optimization (CRO) method is proposed.•Quantization orthogonal crossover (QOX) serves as a global search operator.•QOX can make a systematic and rational search in the solution space.•Our framework is easy to implement.•Our framework is effective in solving optimizatio...
Gespeichert in:
Veröffentlicht in: | Expert systems with applications 2015-04, Vol.42 (6), p.3242-3252 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •An improved chemical reaction optimization (CRO) method is proposed.•Quantization orthogonal crossover (QOX) serves as a global search operator.•QOX can make a systematic and rational search in the solution space.•Our framework is easy to implement.•Our framework is effective in solving optimization problems.
Chemical reaction optimization (CRO) is a newly proposed, easy to implement metaheuristic inspired by the phenomena between molecules in chemical reactions. However, CRO behaves like a random search to traverse the whole solution space, which could confine the algorithm’s search ability. The orthogonal experimental design (OED) method is a robust-design method that can obtain the best combination levels for different factors with a small number of experiment samples based on orthogonal array, thus possesses systematic reasoning ability. In this paper, OCRO, a new method based on CRO and OED, is proposed. This hybrid technique creates new molecules not only by two local search operations in CRO but also incorporates quantization orthogonal crossover (QOX) to serve as a global search operator. OCRO is tested on a set of 23 benchmark functions and compared with variants of CRO, ABC and OXDE, which is also based on the orthogonal method. The computational results show that our framework cannot only find optimal or close-to-optimal solutions but can also obtain more robust results with faster convergence speed in most parts of the experiment, especially for high-dimensional functions. |
---|---|
ISSN: | 0957-4174 1873-6793 |
DOI: | 10.1016/j.eswa.2014.11.045 |