New Advancements in Swarm Algorithms: Operators and Applications (Hardcover, 1st ed. 2020)

This book presents advances in alternative swarm development that have proved to be effective in several complex problems. Swarm intelligence (SI) is a problem-solving methodology that results from the cooperation between a set of agents with similar characteristics. The study of biological entities, such as animals and insects, manifesting social behavior has resulted in several computational models of swarm intelligence. While there are numerous books addressing the most widely known swarm methods, namely ant colony algorithms and particle swarm optimization, those discussing new alternative approaches are rare. The focus on developments based on the simple modification of popular swarm methods overlooks the opportunity to discover new techniques and procedures that can be useful in solving problems formulated by the academic and industrial communities. Presenting various novel swarm methods and their practical applications, the book helps researchers, lecturers, engineers and practitioners solve their own optimization problems.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Intelligent Systems Reference Library, 160
Release date:	April 2019
First published:	2020
Authors:	Erik Cuevas • Fernando Fausto • Adrian Gonzalez
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	296
Edition:	1st ed. 2020
ISBN-13:	978-3-03-016338-9
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-03-016338-5
Barcode:	9783030163389

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!