Mud Ring Algorithm: A New Meta-Heuristic Optimization Algorithm for Solving Mathematical and Engineering Challenges

This paper proposes a new meta-heuristic optimization algorithm, namely Mud Ring Algorithm (MRA) that mimics the mud ring feeding behaviour of bottlenose dolphins in the Atlantic coast of Florida. The inspiration of MRA is mainly based on the foraging behaviour of bottlenose dolphins and their mud r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 10; s. 50448 - 50466
Hlavní autoři: Desuky, Abeer S., Cifci, Mehmet Akif, Kausar, Samina, Hussain, Sadiq, El Bakrawy, Lamiaa M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a new meta-heuristic optimization algorithm, namely Mud Ring Algorithm (MRA) that mimics the mud ring feeding behaviour of bottlenose dolphins in the Atlantic coast of Florida. The inspiration of MRA is mainly based on the foraging behaviour of bottlenose dolphins and their mud ring feeding strategy. This strategy is applied by dolphins to trap fish via creating a plume by a single dolphin moving his tail swiftly in the sand and swims around the group of fish. The fishes become disoriented and jump over the surface only to find the waiting mouths of dolphins. MRA optimization algorithm mathematically simulates this feeding strategy and proves its optimization effectiveness through a comprehensive comparison with other meta-heuristic algorithms. Twenty-nine benchmark functions and four commonly used benchmark engineering challenges are used in the comparison. The statistical comparisons and results prove that the proposed MRA has the superiority in dealing with these optimization problems and can obtain the best solutions than other meta-heuristic optimizers.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3173401