Applications of Flower Pollination Algorithm and its Variants

1. Auflage 2021
ISBN: 978-981-336-103-4
Verlag: Springer Nature Singapore

Buch, Englisch, 239 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 547 g

Reihe: Springer Tracts in Nature-Inspired Computing

This book presents essential concepts of traditional Flower Pollination Algorithm (FPA) and its recent variants and also its application to find optimal solution for a variety of real-world engineering and medical problems. Swarm intelligence-based meta-heuristic algorithms are extensively implemented to solve a variety of real-world optimization problems due to its adaptability and robustness. FPA is one of the most successful swarm intelligence procedures developed in 2012 and extensively used in various optimization tasks for more than a decade. The mathematical model of FPA is quite straightforward and easy to understand and enhance, compared to other swarm approaches. Hence, FPA has attracted attention of researchers, who are working to find the optimal solutions in variety of domains, such as N-dimensional numerical optimization, constrained/unconstrained optimization, and linear/nonlinear optimization problems. Along with the traditional bat algorithm, the enhanced versions of FPA are also considered to solve a variety of optimization problems in science, engineering, and medical applications.

Zielgruppe

Research

Autoren/Hrsg.

Dey, Nilanjan

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Optimierung
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen

Inhaltsverzeichnis

Flower Pollination Algorithm: Basic Concepts, Variants and Applications.- Optimization of Non-rigid Demons Registration using Flower Pollination Algorithm.- Adaptive Neighbour Heuristics Flower Pollination Algorithm Strategy for Sequence Test Generation.- Implementation of flower pollination algorithm to the design optimization of planar antennas.- Flower Pollination Algorithm for Slope Stability Analysis.- Optimum Sizing of Truss Structures Using A Hybrid Flower Pollination.- Optimizing Reinforced Cantilever Retaining Walls Under Dynamic Loading Using Improved Flower Pollination Algorithm.- Multi-Objective Flower Pollination Algorithm and its Variants to Find Optimal Golomb Rulers for WDM System.- Applications of Flower Pollination algorithm in Wireless Sensor Networking and Image processing: A detailed study.- Flower pollination algorithm tuned PID controller for multi-source interconnected multi area power system.

Über Autor(innen)

Nilanjan Dey is an Associate Professor in the Department of Computer Science and Engineering, JIS University, Kolkata, India. He is a visiting fellow of the University of Reading, UK. He is an Adjunct Professor of  Ton Duc Thang University, Ho Chi Minh City, Vietnam. Previously, he held an honorary position of Visiting Scientist at Global Biomedical Technologies Inc., CA, USA (2012–2015). He was awarded his PhD from Jadavpur University in 2015. He has authored/edited more than 80 books with Elsevier, Wiley, CRC Press, and Springer, and published more than 300 papers. He is the Editor-in-Chief of the International Journal of Ambient Computing and Intelligence (IGI Global), Associated Editor of IEEE Access, and International Journal of Information Technology (Springer). He is the Series Co-Editor of Springer Tracts in Nature-Inspired Computing (Springer), Series Co-Editor of Advances in Ubiquitous Sensing Applications for Healthcare (Elsevier), Series Editor ofComputational Intelligence in Engineering Problem Solving and Intelligent Signal Processing and Data Analysis (CRC). His main research interests include medical imaging, machine learning, computer aided diagnosis, data mining, etc. He is the Indian Ambassador of the International Federation for Information Processing—Young ICT Group and Senior member of IEEE.