Artificial Bee Colony Algorithm Based on Quantum Bloch Spherical Optimization

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The swarm intelligence optimization algorithm has strong adaptability to optimization problems, fast computational speed, and the ability to quickly find the optimal solution, demonstrating a momentum of rapid development. As a type of swarm intelligence optimization algorithm, artificial bee colony algorithm obtains the optimal solution through the cyclic foraging and iteration of hired bees, observation bees, and reconnaissance bees, and has now been widely applied in various fields, But the artificial bee colony algorithm has the shortcomings of slow Rate of convergence and easy to fall into the local optimal solution. To overcome these shortcomings, this paper proposes an artificial bee colony algorithm based on the quantum Bloch spherical optimization mechanism. The effectiveness of the algorithm is proved through six benchmark test functions. The experimental results of the convergence curve graph can show that the Rate of convergence is greatly accelerated, and the global optimal solution can be obtained quickly.

Cite

CITATION STYLE

APA

Sun, N., Ren, Z., & Liao, X. (2023). Artificial Bee Colony Algorithm Based on Quantum Bloch Spherical Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14202 LNCS, pp. 39–49). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-45140-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free