Optimizing Engineering Problems through Heuristic Techniques (Paperback)

This book will cover heuristic optimization techniques and applications in engineering problems. The book will be divided into three sections that will provide coverage of the techniques, which can be employed by engineers, researchers, and manufacturing industries, to improve their productivity with the sole motive of socio-economic development. This will be the first book in the category of heuristic techniques with relevance to engineering problems and achieving optimal solutions. Features Explains the concept of optimization and the relevance of using heuristic techniques for optimal solutions in engineering problems Illustrates the various heuristics techniques Describes evolutionary heuristic techniques like genetic algorithm and particle swarm optimization Contains natural based techniques like ant colony optimization, bee algorithm, firefly optimization, and cuckoo search Offers sample problems and their optimization, using various heuristic techniques

General

Imprint:	Taylor & Francis
Country of origin:	United Kingdom
Series:	Science, Technology, and Management
Release date:	September 2021
First published:	2020
Authors:	Kaushik Kumar • Divya Zindani • J. Paulo Davim
Dimensions:	234 x 156mm (L x W)
Format:	Paperback
Pages:	152
ISBN-13:	978-1-03-217632-1
Categories:	Books > Business & Economics > Business & management > Management & management techniques > Operational research Books > Science & Mathematics > Mathematics > Optimization > General Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Books > Science & Mathematics > Mathematics > Applied mathematics > Stochastics Promotions
LSN:	1-03-217632-6
Barcode:	9781032176321

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!