Glowworm Swarm Optimization - Theory, Algorithms, and Applications (Paperback, Softcover reprint of the original 1st ed. 2017)

This book provides a comprehensive account of the glowworm swarm optimization (GSO) algorithm, including details of the underlying ideas, theoretical foundations, algorithm development, various applications, and MATLAB programs for the basic GSO algorithm. It also discusses several research problems at different levels of sophistication that can be attempted by interested researchers. The generality of the GSO algorithm is evident in its application to diverse problems ranging from optimization to robotics. Examples include computation of multiple optima, annual crop planning, cooperative exploration, distributed search, multiple source localization, contaminant boundary mapping, wireless sensor networks, clustering, knapsack, numerical integration, solving fixed point equations, solving systems of nonlinear equations, and engineering design optimization. The book is a valuable resource for researchers as well as graduate and undergraduate students in the area of swarm intelligence and computational intelligence and working on these topics.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Studies in Computational Intelligence, 698
Release date:	July 2018
First published:	2017
Authors:	Krishnanand N. Kaipa • Debasish Ghose
Dimensions:	235 x 155 x 15mm (L x W x T)
Format:	Paperback
Pages:	248
Edition:	Softcover reprint of the original 1st ed. 2017
ISBN-13:	978-3-319-84694-1
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-319-84694-9
Barcode:	9783319846941

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!