Applications Of Flower Pollination Algorithm And Its Variants


Download Applications Of Flower Pollination Algorithm And Its Variants PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Applications Of Flower Pollination Algorithm And Its Variants book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

Applications of Flower Pollination Algorithm and its Variants


Applications of Flower Pollination Algorithm and its Variants

Author: Nilanjan Dey

language: en

Publisher: Springer Nature

Release Date: 2021-03-17


DOWNLOAD





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.

Nature-Inspired Algorithms and Applied Optimization


Nature-Inspired Algorithms and Applied Optimization

Author: Xin-She Yang

language: en

Publisher: Springer

Release Date: 2017-10-18


DOWNLOAD





This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.

Applications of Firefly Algorithm and its Variants


Applications of Firefly Algorithm and its Variants

Author: Nilanjan Dey

language: en

Publisher: Springer Nature

Release Date: 2019-11-09


DOWNLOAD





The book discusses advantages of the firefly algorithm over other well-known metaheuristic algorithms in various engineering studies. The book provides a brief outline of various application-oriented problem solving methods, like economic emission load dispatch problem, designing a fully digital controlled reconfigurable switched beam nonconcentric ring array antenna, image segmentation, span minimization in permutation flow shop scheduling, multi-objective load dispatch problems, image compression, etc., using FA and its variants. It also covers the use of the firefly algorithm to select features, as research has shown that the firefly algorithm generates precise and optimal results in terms of time and optimality. In addition, the book also explores the potential of the firefly algorithm to provide a solution to traveling salesman problem, graph coloring problem, etc