Opposition-based quantum firework algorithm for continuous optimisation problems
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.
- scientific article; zbMATH DE number 2221958
- Quantum optimization
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- Quantum stochastic optimization
- Solving a class of continuous global optimization problems using quantum algorithms
- scientific article; zbMATH DE number 2013817
- QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- The parallel quantum algorithm for the class of optimization
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
This page was built for publication: Opposition-based quantum firework algorithm for continuous optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224022)