Skip to main content

Improved Dragonfly Algorithm Based on Mixed Strategy

  • Conference paper
  • First Online:
Computer Science and Education. Computer Science and Technology (ICCSE 2023)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2023))

Included in the following conference series:

  • 180 Accesses

Abstract

With the rapid development of today, the swarm intelligence optimization algorithm is very popular and has been used in many fields. Dragonfly algorithm (DA) is one of the optimization algorithms, which has been used in some aspects. But it still has some shortcomings, such as slow convergence speed and search precision, and it is also prone to fall into local optimal solutions. Aiming at the shortcomings of the original dragonfly algorithm, a mixed strategy improved dragonfly algorithm (MSDA) is proposed. The algorithm introduces some improvement strategies. Firstly, initialize the population with the Sobol sequence. This allows the algorithm to obtain a better initial population, improve the quality of initial solution. Secondly, inertia weight improvement, use a nonlinear decreasing inertia weight. The modification of inertia weight makes the algorithm better adapt to the convergence process. Then using Cauchy mutation to increase the diversity of the population, improve the global search ability of the algorithm, and increase the search space. Finally, a random learning strategy is added. The random learning strategy enhances the diversity of the population, effectively improve the global optimization performance of the algorithm. The experiment is tested by eight standard test functions, results show that MSDA is better than the original DA algorithm in terms of convergence speed, solution accuracy and stability.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, X., et al.: Forecasting short-term electric load using extreme learning machine with improved tree seed algorithm based on Lévy flight. Eksploatacjai Niezawodnosc Maintenance Reliability 24(1), 153–162 (2022)

    Google Scholar 

  2. Sun, S., Przystupa, K., Wei, M., Yu, H., Ye, Z., Kochan, O.: Fast bearing fault diagnosis of rolling element using Lévy Moth-Flame optimization algorithm and Naive Bayes. Eksploatacjai Niezawodnosc Maintenance Reliability 22(4), 730–740 (2020)

    Google Scholar 

  3. Xu, H., Przystupa, K., Fang, C., Marciniak, A., Kochan, O., Beshley, M.: A combination strategy of feature selection based on an integrated optimization algorithm and weighted k-nearest neighbor to improve the performance of network intrusion detection. Electronics 9(8), 1206 (2020)

    Article  Google Scholar 

  4. Mirjalili, S.: Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 27(4), 1053–1073 (2015). https://doi.org/10.1007/s00521-015-1920-1

    Article  Google Scholar 

  5. Tharwat, A., Gabel, T., Hassanien, A.E.: Parameter optimization of support vector machine using dragonfly algorithm. In: Hassanien, A.E., Shaalan, K., Gaber, T., Tolba, M.F. (eds.) AISI 2017. AISC, vol. 639, pp. 309–319. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-64861-3_29

    Chapter  Google Scholar 

  6. Abdel-Basset, M., Luo, Q., Miao, F., Zhou, Y.: Solving 0–1 knapsack problems by binary dragonfly algorithm. In: Huang, D.-S., Hussain, A., Han, K., Gromiha, M.M. (eds.) ICIC 2017. LNCS (LNAI), vol. 10363, pp. 491–502. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63315-2_43

    Chapter  Google Scholar 

  7. Russell, R.W., May, M.L., Soltesz, K.L., et al.: Massive swarm migrations of dragonflies (Odonata) in eastern North America. Am. Midl. Nat. 140(2), 325–342 (1998)

    Article  Google Scholar 

Download references

Acknowledgment

This work is funded by the National Natural Science Foundation of China under Grant No. 61772180, the Key R & D plan of Hubei Province (2020BHB004, 2020BAB012).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shenyang Xia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xia, S., Liu, X. (2024). Improved Dragonfly Algorithm Based on Mixed Strategy. In: Hong, W., Kanaparan, G. (eds) Computer Science and Education. Computer Science and Technology. ICCSE 2023. Communications in Computer and Information Science, vol 2023. Springer, Singapore. https://doi.org/10.1007/978-981-97-0730-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-0730-0_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-0729-4

  • Online ISBN: 978-981-97-0730-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics