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

MARC

LEADER 00000naa0a2200000 4500
001 668725
005 20260807071633.0
035 |a (RuTPU)RU\TPU\network\39962 
035 |a RU\TPU\network\39961 
090 |a 668725 
100 |a 20230119d2022 k||y0rusy50 ba 
101 0 |a eng 
102 |a DE 
135 |a drcn ---uucaa 
181 0 |a i  
182 0 |a b 
200 1 |a Black hole algorithm: A comprehensive survey  |f A. Laith, A. M. Mokhamed Elsaed (Mohamed Abd Elaziz), P. Sumari [et al.] 
203 |a Text  |c electronic 
300 |a Title screen 
320 |a [References: 142 tit.] 
330 |a 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. 
333 |a Режим доступа: по договору с организацией-держателем ресурса 
461 |t Applied Intelligence 
463 |t Vol. 52, iss. 10  |v [P. 11892–11915]  |d 2022 
610 1 |a электронный ресурс 
610 1 |a труды учёных ТПУ 
610 1 |a black hole algorithm 
610 1 |a optimization algorithms 
610 1 |a meta-heuristics 
610 1 |a real-word problems 
610 1 |a optimization problems 
610 1 |a algorithm 
610 1 |a optimization 
610 1 |a алгоритмы 
610 1 |a черные дыры 
610 1 |a оптимизация 
610 1 |a метаэвристика 
610 1 |a оптимизация 
701 1 |a Laith  |b A.  |g Abualigah 
701 1 |a Mokhamed Elsaed (Mohamed Abd Elaziz)  |b A. M.  |c Specialist in the field of informatics and computer technology  |c Professor of Tomsk Polytechnic University  |f 1987-  |g Akhmed Mokhamed  |3 (RuTPU)RU\TPU\pers\46943 
701 1 |a Sumari  |b P.  |g Putra 
701 1 |a Ahmad  |b M. Kh.  |g Khasawneh 
701 1 |a Mohammad  |b A.  |g Alshinwan 
701 1 |a Seyedali  |b M.  |g Mirjalili 
701 1 |a Mohammad  |b Sh.  |g Shehab 
701 1 |a Hayfa  |b Y. A.  |g Abuaddous 
701 1 |a Amir  |b H. G.  |g Gandomi 
712 0 2 |a Национальный исследовательский Томский политехнический университет  |b Инженерная школа информационных технологий и робототехники  |c 2017-  |x TPU  |7 ca  |8 rus  |9 28330 
801 0 |a RU  |b 63413507  |c 20230119  |g RCR 
856 4 |u https://doi.org/10.1007/s10489-021-02980-5 
942 |c CF