Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 692

The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.

A mayfly optimization algorithm

Zervoudakis, Konstantinos, Tsafarakis, Stelios·2020·Computers & Industrial Engineering

Abstract

Abstract This paper introduces a new method called the Mayfly Algorithm (MA) to solve optimization problems. Inspired from the flight behavior and the mating process of mayflies, the proposed algorithm combines major advantages of swarm intelligence and evolutionary algorithms. To evaluate the performance of the proposed algorithm, 38 mathematical benchmark functions, including 13 CEC2017 test functions, are employed and the results are compared to those of seven state of the art well-known metaheuristic optimization methods. The MA’s performance is also assessed through convergence behavior in multi-objective optimization as well as using a real-world discrete flow-shop scheduling problem. The comparison results demonstrate the superiority of the proposed method in terms of convergence rate and convergence speed. The processes of nuptial dance and random flight enhance the balance between algorithm’s exploration and exploitation properties and assist its escape from local optima.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.cie.2020.106559

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 49 references

Cited by

See all 692

Metadata

Authors
Zervoudakis, K., & Tsafarakis, S.
Venue
Computers & Industrial Engineering
Publisher
Elsevier BV
Published
2020-07
Volume
145
Pages
106559
ISSN
0360-8352 (ISSN-L)
OpenAlex
W3029517552
Cited by
692
References
49
FWCI
39.30
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A mayfly optimization algorithm. https://app.cochat.ai/papers/10.1016/j.cie.2020.106559
The paper
Zervoudakis, K., & Tsafarakis, S. (2020). A mayfly optimization algorithm. Computers & Industrial Engineering. https://doi.org/10.1016/j.cie.2020.106559

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.