Jump to content

Mayfly optimization algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by GusRDRM (talk | contribs) at 18:42, 7 April 2021 (Created page with '{{subst:AfC submission/draftnew}}<!-- Important, do not remove this line before article has been created. --> The mayfly optimization algorithm was developed...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


The mayfly optimization algorithm was developed to address both continuous and discrete optimization problems and is inspired from the flight behavior and the mating process of mayflies. The processes of nuptial dance and random flight enhance the balance between the algorithm's exploration and exploitation properties and assist its escape from local optima. The performance of the mayfly algorithm is superior to that of other popular metaheuristics like PSO, DE, GA and FA, in terms of convergence rate and convergence speed. [1]


References

  1. ^ Zervoudakis, Konstantinos; Tsafarakis, Stelios (2020). "A mayfly optimization algorithm". Computers & Industrial Engineering. ahead-of-print (ahead-of-print): head-of-print. doi:10.1016/j.cie.2020.106559.