[go: up one dir, main page]

Skip to main content
Log in

Chaos quantum bee colony algorithm for constrained complicate optimization problems and application of robot gripper

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Global constrained optimization problems are very complex for engineering applications. To solve complicated and constrained optimization problems with fast convergence and accurate computations, a new quantum artificial bee colony algorithm using Sin chaos and Cauchy factor (SCQABC) is proposed. The algorithm introduces a quantum bit to initialize the population, which is then updated by the quantum rotation gate to enhance the convergence of the artificial bee colony algorithm (ABC). Sin chaos is introduced to process the individual positions, which improves the randomness and ergodicity of initializing individuals and results in a more diverse initial population. To overcome the upper limits of visiting target individual positions, Cauchy factor is used to mutate individuals for solving falling into local optimum problems. To evaluate the performance of the SCQABC, 20 classical benchmark functions and CEC-2017 are used. The practical engineering problems are also used to verify the practicability of SCQABC algorithm. Moreover, the experimental results will be compared with other well-known and progressive algorithms. According to the results, the SCQABC improves by 64.93% compared with the ABC and also has corresponding improvement compared with other algorithms. Its successful application to the robot gripper problem highlights its effectiveness in solving constrained optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Algorithm 1
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data Availibility Statement

All data generated or analyzed during this study are included in this article and can be obtained by contacting the corresponding author.

References

Download references

Funding

This work is funded by the Natural Science Foundation of Zhejiang Province (Grant No. LY22F030012), the National Natural Science Foundation of China (Grant No. 62003320) and Fundamental Research Funds for the Provincial Universities of Zhejiang (Grant No. 2021YW10).

Author information

Authors and Affiliations

Authors

Contributions

Ruizi Ma provided the methodlogy and implemention of the research. Ruizi Ma and Junbao Gui write the paper. Jun Wen and Xu Guo edit the paper.

Corresponding author

Correspondence to Ruizi Ma.

Ethics declarations

Conflict of interest

The authors have no Conflict of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

Since there are a lot of experimental data in this paper, which will affect the reading experience, these data are put in the Appendix.

See Tables 13, 14, 15, 16, 17, 18 and 19.

Table 13 Comparison of SCQABC with other algorithms on 10-dimensional classical benchmark functions
Table 14 Comparison of SCQABC with other algorithms on 30-dimensional classical benchmark functions
Table 15 Comparison of SCQABC with other algorithms on 50-dimensional classical benchmark functions
Table 16 Comparison of SCQABC with other algorithms on 10-dimensional CEC-2017
Table 17 Comparison of SCQABC with other algorithms on 30-dimensional CEC-2017
Table 18 Comparison of SCQABC with other algorithms on 50-dimensional CEC-2017
Table 19 Comparison of SCQABC with other algorithms on 100-dimensional CEC-2017

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, R., Gui, J., Wen, J. et al. Chaos quantum bee colony algorithm for constrained complicate optimization problems and application of robot gripper. Soft Comput 28, 11163–11206 (2024). https://doi.org/10.1007/s00500-024-09877-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-024-09877-8

Keywords

Navigation