Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/2000
Title: | Eurasian oystercatcher optimiser: New meta-heuristic algorithm |
Authors: | Salim, Ahmad Jummar, Wisam Jasim, Farah Yousif, Mohammed |
Keywords: | meta-heuristic optimisation Eurasian oystercatcher optimiser Eurasian oystercatcher |
Issue Date: | 4-Mar-2022 |
Publisher: | De Gruyter |
Citation: | Salim, Ahmad, Jummar, Wisam K., Jasim, Farah Maath and Yousif, Mohammed. "Eurasian oystercatcher optimiser: New meta-heuristic algorithm" Journal of Intelligent Systems, vol. 31, no. 1, 2022, pp. 332-344. |
Series/Report no.: | 31;1 |
Abstract: | Modern optimisation is increasingly relying on meta-heuristic methods. This study presents a new meta-heuristic optimisation algorithm called Eurasian oystercatcher optimiser (EOO). The EOO algorithm mimics food behaviour of Eurasian oystercatcher (EO) in searching for mussels. In EOO, each bird (solution) in the population acts as a search agent. The EO changes the candidate mussel according to the best solutions to finally eat the best mussel (optimal result). A balance must be achieved among the size, calories, and energy of mussels. The proposed algorithm is benchmarked on 58 test functions of three phases (unimodal, multimodal, and fixed-diminution multimodal) and compared with several important algorithms as follows: particle swarm optimiser, grey wolf optimiser, biogeography based optimisation, gravitational search algorithm, and artificial bee colony. Finally, the results of the test functions prove that the proposed algorithm is able to provide very competitive results in terms of improved exploration and exploitation balances and local optima avoidance. |
URI: | http://localhost:8080/xmlui/handle/123456789/2000 |
ISSN: | 2191-026X |
Appears in Collections: | مركز التعليم المستمر |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
3-Eurasian oystercatcher optimiser New meta-heuristic algorithm.pdf | 2.38 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.