Skip to main content
Book cover

Applications of Flower Pollination Algorithm and its Variants

  • Book
  • © 2021

Overview

  • Highlights the essential concepts of traditional Flower Pollination Algorithm and its recent variants
  • Provides optimal solution for a variety of real-world engineering and medical problems
  • Serves as a reference resource for researchers and academicians

Part of the book series: Springer Tracts in Nature-Inspired Computing (STNIC)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Science and Engineering, JIS University, Kolkata, India

    Nilanjan Dey

About the editor

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.

Bibliographic Information

Publish with us