Improved Dragonfly Algorithm with Neighbourhood Structures

Authors

  • S. Rajalakshmi  Department of Information Technology, Pondicherry Engineering College, Puducherry, India
  • S. Kanmani  Department of Information Technology, Pondicherry Engineering College, Puducherry, India
  • S. Saraswathi  Department of Information Technology, Pondicherry Engineering College, Puducherry, India

DOI:

https://doi.org/10.32628/IJSRST218446

Keywords:

Dragonfly Algorithm, Neighbourhood Structures, Unimodal, Multimodal, Gear Train

Abstract

Dragonfly algorithm is a recently proposed optimization algorithm inspired on the static and dynamic swarming behaviour of dragonflies. Because of its simplicity and effectiveness, DA has received interest of specialists from various fields. Premature convergence and local optima is an issue in Dragonfly Algorithm. Improved Dragonfly Algorithm with Neighbourhood Structures (IDANS) is proposed to overcome this drawback. Dragonfly Algorithm with Neighborhood structures utilizes candidate solutions in an iterative and intuitive process to discover promising areas in a search space. IDANS is then initialized with best value of dragonfly algorithm to further explore the search space. In order to improve the efficiency of IDANS, Neighbourhood structures such as Euclidean, Manhattan and Chebyshev are chosen to implement these structures on IDANS to obtain best results. The proposed method avoids local optima to achieve global optimal solutions. The Efficiency of the IDANS is validated by testing on benchmark functions and classical engineering problem called Gear train design problem. A comparative performance analysis between IDANS and other powerful optimization algorithms have been carried out and the results shows that IDANS gives better performance than Dragonfly algorithm. Moreover it gives competitive results in terms of convergence and accuracy when compared with other algorithms in the literature.

References

  1. Arora and Singh, “Butterfly optimization algorithm: a novel approach for global optimization”, Journal of Soft Computing, pp 1-20,08 (2018).
  2. S. Mirjalili, “Dragonfly algorithm: a new meta- heuristic optimization technique for solving single-objective, discrete, and multi-objective problems”, Neural Computing & Applications, pp 1053-1073 (2015).
  3. Karaboga D,” Powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm”, Journal of Global Optimization, pp 459–471 (2007).
  4. Dorigo M, “The ant colony optimization metaheuristic: algorithms, applications, and advances”, Handbook of metaheuristics, pp 250–285, (2003).
  5. S. Mirjalili, “The Ant Lion Optimizer”, Advances in Engineering Software, pp 80-98 (2015).
  6. Arora S , “The firefly optimization algorithm: convergence analysis and parameter selection”, International Journal of Computing Applications, pp 48–52 (2013).
  7. Goldberg DE, “Genetic algorithms and machine Learning”, Machine Learning, pp 95–99 (1988).
  8. Eberhart and Shi, “Particle swarm optimization: developments, applications and resources”, Evolutionary computation, pp 81–86 (2001).
  9. Yang and Gandomi, “Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems”, Engineering Computing ,pp 17–35 (2013).
  10. Wang , Deb and Cui , “Monarch butterfly optimization”, Neural Computing and Applications (2015).
  11. Yang X-S, “A new metaheuristic bat-inspired algorithm”, Nature inspired cooperative strategies for optimization, pp 65–74 (2010).
  12. Yang X-S, “Flower pollination algorithm for global optimization”, Unconventional computation and natural computation, pp 240–249 (2012).
  13. Cuevas, “An optimization algorithm inspired by the States of Matter that improves the balance between exploration and exploitation”, Applied Intelligence,pp 256–272 (2014).
  14. S. Mirjalili, “Moth-flame optimization algorithm: A novel nature inspired heuristic paradigm”, Knowledge –Based Systems, pp 228- 249 (2015)
  15. Rafael Stubs Parpinelli, "Population-based Variable Neighborhood Search Algorithm Applied toUnconstrained Continuous Optimization", International Journal of Bio-Inspired Computation,pp-73-80 (2017).
  16. Sadollah A, Bahreininejad A, Eskandar H, Hamdi M. Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 2013;13:2592–612.
  17. Gandomi AH. Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 2014.
  18. Kannan B, Kramer SN. An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 1994;116:405–11.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2021-08-30

Issue

Volume 8, Issue 4, July-August-2021

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
S. Rajalakshmi, S. Kanmani, S. Saraswathi "Improved Dragonfly Algorithm with Neighbourhood Structures" International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011,Volume 8, Issue 4, pp.303-309, July-August-2021. Available at doi : https://doi.org/10.32628/IJSRST218446