Araştırma Makalesi

A Novel Modified Lévy Flight Distribution Algorithm based on Nelder-Mead Method for Function Optimization

Cilt: 12 Sayı: 3 29 Haziran 2021
PDF İndir
EN

A Novel Modified Lévy Flight Distribution Algorithm based on Nelder-Mead Method for Function Optimization

Abstract

This paper aims to improve one of the recently proposed metaheuristic approaches known as Lévy flight distribution (LFD) algorithm by adopting a well-known simplex search algorithm named Nelder-Mead (NM) method. Three new strategies were utilized to demonstrate the improved capability of the original LFD algorithm. In the first strategy, NM was run twice as much the number of iterations of LFD after the latter completes its task. In the second strategy, NM was applied after each iterations of LFD instead of waiting for the completion of the latter. Lastly, in the third strategy, NM was applied after each iterations of LFD and run for the total number of current iterations of the latter algorithm. Well-known unimodal and multimodal benchmark functions were adopted, and statistical analysis was performed for performance evaluation. Further assessment was carried out through a nonparametric statistical test. The obtained results have shown the proposed versions of LFD algorithm provide significant performance improvement in general. In addition, the efficiency of the third strategy was found to be better for NM modified LFD algorithm which has greater balance between global and local search stages and can be used as an effective tool for function optimization.

Keywords

Kaynakça

  1. [1] L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz, and A. H. Gandomi, “The Arithmetic Optimization Algorithm,” Comput. Methods Appl. Mech. Eng., vol. 376, p. 113609, Apr. 2021, doi: 10.1016/j.cma.2020.113609.
  2. [2] W. Zhao, L. Wang, and Z. Zhang, “Supply-Demand-Based Optimization: A Novel Economics-Inspired Algorithm for Global Optimization,” IEEE Access, vol. 7, pp. 73182–73206, 2019, doi: 10.1109/ACCESS.2019.2918753.
  3. [3] D. Izci, S. Ekinci, E. Eker, and M. Kayri, “Improved Manta Ray Foraging Optimization Using Opposition-based Learning for Optimization Problems,” in 2020 International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA), Jun. 2020, pp. 1–6, doi: 10.1109/HORA49412.2020.9152925.
  4. [4] A. F. Nematollahi, A. Rahiminejad, and B. Vahidi, “A novel meta-heuristic optimization method based on golden ratio in nature,” Soft Comput., vol. 24, no. 2, pp. 1117–1151, 2020, doi: 10.1007/s00500-019-03949-w.
  5. [5] F. A. Hashim, K. Hussain, E. H. Houssein, M. S. Mabrouk, and W. Al-Atabany, “Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems,” Appl. Intell., 2020, doi: 10.1007/s10489-020-01893-z.
  6. [6] E. Eker, M. Kayri, S. Ekinci, and D. Izci, “A New Fusion of ASO with SA Algorithm and Its Applications to MLP Training and DC Motor Speed Control,” Arab. J. Sci. Eng., Feb. 2021, doi: 10.1007/s13369-020-05228-5.
  7. [7] W. Zhao, L. Wang, and Z. Zhang, “Artificial ecosystem-based optimization: a novel nature-inspired meta-heuristic algorithm,” Neural Comput. Appl., pp. 1–43, 2019.
  8. [8] D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67–82, 1997, doi: 10.1109/4235.585893.

Ayrıntılar

Birincil Dil

İngilizce

Konular

-

Bölüm

Araştırma Makalesi

Yayımlanma Tarihi

29 Haziran 2021

Gönderilme Tarihi

20 Şubat 2021

Kabul Tarihi

1 Mayıs 2021

Yayımlandığı Sayı

Yıl 2021 Cilt: 12 Sayı: 3

Kaynak Göster

IEEE
[1]A. Dündar, D. İzci, S. Ekinci, ve E. Eker, “A Novel Modified Lévy Flight Distribution Algorithm based on Nelder-Mead Method for Function Optimization”, DÜMF MD, c. 12, sy 3, ss. 487–497, Haz. 2021, doi: 10.24012/dumf.955645.

Cited By

DUJE tarafından yayınlanan tüm makaleler, Creative Commons Atıf 4.0 Uluslararası Lisansı ile lisanslanmıştır. Bu, orijinal eser ve kaynağın uygun şekilde belirtilmesi koşuluyla, herkesin eseri kopyalamasına, yeniden dağıtmasına, yeniden düzenlemesine, iletmesine ve uyarlamasına izin verir. 24456