Evolutionary Optimization Algorithms (Hardcover)

This comprehensive reference text discusses evolutionary optimization techniques, to find optimal solutions for single and multi-objective problems. The text presents each evolutionary optimization algorithm along with its history and other working equations. It also discusses variants and hybrids of optimization techniques. The text presents step-by-step solution to a problem and includes software's like MATLAB and Python for solving optimization problems. It covers important optimization algorithms including single objective optimization, multi objective optimization, Heuristic optimization techniques, shuffled frog leaping algorithm, bacteria foraging algorithm and firefly algorithm. Aimed at senior undergraduate and graduate students in the field of electrical engineering, electronics engineering, mechanical engineering, and computer science and engineering, this text: Provides step-by-step solution for each evolutionary optimization algorithm. Provides flowcharts and graphics for better understanding of optimization techniques. Discusses popular optimization techniques include particle swarm optimization and genetic algorithm. Presents every optimization technique along with the history and working equations. Includes latest software like Python and MATLAB.

General

Imprint:	Crc Press
Country of origin:	United Kingdom
Release date:	October 2021
First published:	2022
Authors:	Altaf Q. H. Badar
Dimensions:	234 x 156 x 23mm (L x W x T)
Format:	Hardcover
Pages:	261
ISBN-13:	978-0-367-75054-1
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	0-367-75054-6
Barcode:	9780367750541

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!