Szczegóły publikacji

Opis bibliograficzny

Exploiting flower constancy in flower pollination algorithm: improved biotic flower pollination algorithm and its experimental evaluation / Paweł KOPCIEWICZ, Szymon ŁUKASIK // Neural Computing & Applications ; ISSN 0941-0643. — 2020 — vol. 32 iss. 16 spec. iss. Real-world optimization problems and meta-heuristics, s. 11999–12010. — Bibliogr. s. 12009-12010, Abstr. — Publikacja dostępna online od: 2019-04-10. — Sz. Łukasik - dod. afiliacja: Systems Research Institute, Polish Academy of Sciences

Autorzy (2)

Słowa kluczowe

flower pollination algorithmnature inspired algorithmsmetaheuristicsoptimization

Dane bibliometryczne

ID BaDAP128147
Data dodania do BaDAP2020-09-18
Tekst źródłowyURL
DOI10.1007/s00521-019-04179-9
Rok publikacji2020
Typ publikacjiartykuł w czasopiśmie
Otwarty dostęptak
Creative Commons
Czasopismo/seriaNeural Computing & Applications

Abstract

Recent growth of metaheuristic search strategies has brought a huge progress in the domain of computational optimization. The breakthrough started since the well-known Particle Swarm Optimization algorithm had been introduced and examined. Optimization technique presented in this contribution mimics the process of flower pollination. It is build on the foundation of the first technique of this kind—known as Flower Pollination Algorithm (FPA). In this paper, its simplified and improved version, obtained after extensive performance testing, is presented. It is based on only one natural phenomena—called flower constancy—the natural mechanism allowing pollen carrying insects to remember the positions of the best pollen sources. Modified FPA, named as Biotic Flower Pollination Algorithm (BFPA) and relying solely on biotic pollinators, outperforms original FPA, which itself proved to be very effective approach. The paper first presents a short description of original FPA and the changes leading to Biotic Flower Pollination Algorithm. It also discusses performance of the modified algorithm on a full set of CEC17 benchmark functions. Furthermore, in that aspect, the comparison between BFPA and other optimization algorithms is also given. Finally, brief exemplary application of modified algorithm in the field of probabilistic modeling, related to physics and engineering, is also presented. © 2019, The Author(s).

Publikacje, które mogą Cię zainteresować

fragment książki
#103235Data dodania: 24.1.2017
Comparison of Krill Herd Algorithm and Flower Pollination Algorithm in clustering task / Piotr A. KOWALSKI, Szymon ŁUKASIK, Małgorzata Charytanowicz, Piotr KULCZYCKI // W: ESCIM 2016 [Dokument elektroniczny] : 8th European Symposium on Computational Intelligence and Mathematics : Sofia, Bulgaria, October 5th–8th, 2016 : proceedings / eds. László Kóczy, Jesús Medina. — Wersja do Windows. — Dane tekstowe. — Spain : Universidad de Cádiz, 2016. — e-ISBN: 978-84-617-5119-8. — S. 31–36. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: http://escim2016.uca.es/wp-content/uploads/2016/10/ESCIM-2016... [2017-01-11]. — Bibliogr. s. 36, Abstr. — P. A. Kowalski, Sz. Łukasik, P. Kulczycki – dod. afiliacja: Polish Academy of Sciences
fragment książki
#122347Data dodania: 29.10.2019
Triggering Probabilistic Neural Networks with Flower Pollination Algorithm / Piotr A. KOWALSKI, Konrad Wadas // W: Computational intelligence and mathematics for tackling complex problems / eds. László T. Kóczy, [et al.]. — Cham : Springer, cop. 2020. — (Studies in Computational Intelligence ; ISSN 1860-949X ; 819). — Publikacja zawiera materiały z konferencji ESCIM 2018 : tenth European Symposium on Computational Intelligence and Mathematics, 7-10 October 2018, Riga, Latvia. — ISBN: 978-3-030-16023-4; e-ISBN: 978-3-030-16024-1. — S. 107-113. — Bibliogr., Abstr. — Publikacja dostępna online od: 2019-05-03. — P. A. Kowalski - dod. afiliacja: Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland