Meta-heuristic and Evolutionary Algorithms for Engineering Optimization

Meta-heuristic and Evolutionary Algorithms for Engineering Optimization

EnglishHardback
Bozorg-Haddad, Omid
John Wiley & Sons Inc
EAN: 9781119386995
Available at distributor
Delivery on Thursday, 20. of August 2026
CZK 3,023
Common price CZK 3,359
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

A detailed review of a wide range of meta-heuristic and evolutionary algorithms in a systematic manner and how they relate to engineering optimization problems

This book introduces the main metaheuristic algorithms and their applications in optimization. It describes 20 leading meta-heuristic and evolutionary algorithms and presents discussions and assessments of their performance in solving optimization problems from several fields of engineering. The book features clear and concise principles and presents detailed descriptions of leading methods such as the pattern search (PS) algorithm, the genetic algorithm (GA), the simulated annealing (SA) algorithm, the Tabu search (TS) algorithm, the ant colony optimization (ACO), and the particle swarm optimization (PSO) technique.

Chapter 1 of Meta-heuristic and Evolutionary Algorithms for Engineering Optimization provides an overview of optimization and defines it by presenting examples of optimization problems in different engineering domains. Chapter 2 presents an introduction to meta-heuristic and evolutionary algorithms and links them to engineering problems. Chapters 3 to 22 are each devoted to a separate algorithm— and they each start with a brief literature review of the development of the algorithm, and its applications to engineering problems. The principles, steps, and execution of the algorithms are described in detail, and a pseudo code of the algorithm is presented, which serves as a guideline for coding the algorithm to solve specific applications. This book:

  • Introduces state-of-the-art metaheuristic algorithms and their applications to engineering optimization;
  • Fills a gap in the current literature by compiling and explaining the various meta-heuristic and evolutionary algorithms in a clear and systematic manner;
  • Provides a step-by-step presentation of each algorithm and guidelines for practical implementation and coding of algorithms;
  • Discusses and assesses the performance of metaheuristic algorithms in multiple problems from many fields of engineering;
  • Relates optimization algorithms to engineering problems employing a unifying approach.

Meta-heuristic and Evolutionary Algorithms for Engineering Optimization is a reference intended for students, engineers, researchers, and instructors in the fields of industrial engineering, operations research, optimization/mathematics, engineering optimization, and computer science.

OMID BOZORG-HADDAD, PhD, is Professor in the Department of Irrigation and Reclamation Engineering at the University of Tehran, Iran.

MOHAMMAD SOLGI, M.Sc., is Teacher Assistant for M.Sc. courses at the University of Tehran, Iran.

HUGO A. LOÁICIGA, PhD, is Professor in the Department of Geography at the University of California, Santa Barbara, United States of America.

EAN 9781119386995
ISBN 1119386993
Binding Hardback
Publisher John Wiley & Sons Inc
Publication date December 1, 2017
Pages 304
Language English
Dimensions 229 x 158 x 31
Country United States
Readership Professional & Scholarly
Authors Bozorg-Haddad, Omid; Loaiciga, Hugo A.; Solgi, Mohammad
Edition 1. Auflage
Series Wiley Series in Operations Research and Management Science
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.