Black hole algorithm: A comprehensive survey; Applied Intelligence; Vol. 52, iss. 10

Bibliografiset tiedot
Parent link:Applied Intelligence
Vol. 52, iss. 10.— 2022.— [P. 11892–11915]
Yhteisötekijä: Национальный исследовательский Томский политехнический университет Инженерная школа информационных технологий и робототехники
Muut tekijät: Laith A. Abualigah, Mokhamed Elsaed (Mohamed Abd Elaziz) A. M. Akhmed Mokhamed, Sumari P. Putra, Ahmad M. Kh. Khasawneh, Mohammad A. Alshinwan, Seyedali M. Mirjalili, Mohammad Sh. Shehab, Hayfa Y. A. Abuaddous, Amir H. G. Gandomi
Yhteenveto:Title screen
This paper provides an in-depth literature review of the Black Hole Algorithm (BHA) which is considered as a recent metaheuristic. BHA has been proven to be very efficient in different applications. There has been several modifications and variants of this algorithm in the literature, so this work reviews various variants of the BHA. The applications of BHA in engineering problems, clustering, task scheduling, image processing, etc. have been thoroughly reviewed as well. This review article sheds lights on the pros and cons of this algorithm and enables finding a right variant of this algorithm for a certain application area. The paper concludes with an in-depth future direction.
Режим доступа: по договору с организацией-держателем ресурса
Kieli:englanti
Julkaistu: 2022
Aiheet:
Linkit:https://doi.org/10.1007/s10489-021-02980-5
Aineistotyyppi: Elektroninen Kirjan osa
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=668725
Kuvaus
Yhteenveto:Title screen
This paper provides an in-depth literature review of the Black Hole Algorithm (BHA) which is considered as a recent metaheuristic. BHA has been proven to be very efficient in different applications. There has been several modifications and variants of this algorithm in the literature, so this work reviews various variants of the BHA. The applications of BHA in engineering problems, clustering, task scheduling, image processing, etc. have been thoroughly reviewed as well. This review article sheds lights on the pros and cons of this algorithm and enables finding a right variant of this algorithm for a certain application area. The paper concludes with an in-depth future direction.
Режим доступа: по договору с организацией-держателем ресурса
DOI:10.1007/s10489-021-02980-5