Opposition-based quantum firework algorithm for continuous optimisation problems (Q2224022)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Opposition-based quantum firework algorithm for continuous optimisation problems |
scientific article |
Statements
Opposition-based quantum firework algorithm for continuous optimisation problems (English)
0 references
3 February 2021
0 references
Summary: A novel intelligence algorithm for continuous optimisation problem is proposed in this paper, termed as opposition-based quantum firework algorithm (OQFA). The proposed OQFA combines fireworks algorithm (FA) and two improved operators: opposition-based learning and quantum computing theory. The opposition-based learning operator can accelerate the convergence rate of algorithm by retaining the better solution, and the quantum computing theory can ameliorate the capability of searching and enhance the exploration efficiency of the solution space. Since OQFA has the features of both opposition-based learning and quantum computing, it has a high possibility to find a global optimum and avoids premature convergence. Experimental results on five test functions show that OQFA outperforms cultural algorithm (CA), particle swarm optimisation (PSO) and FA in terms of convergence rate and convergence accuracy.
0 references
quantum fireworks algorithm
0 references
opposition-based learning
0 references
continuous optimisation
0 references
quantum computing
0 references
global optimum
0 references