Constraint Handling in Cohort Intelligence Algorithm - Couverture rigide

Kale, Ishaan R.; Kulkarni, Anand J.

Couverture rigide

ISBN 10 : 1032150750 ISBN 13 : 9781032150758

Editeur : CRC Press, 2021

Synopsis

Mechanical Engineering domain problems are generally complex, consisting of different design variables and constraints. These problems may not be solved using gradient-based optimization techniques. The stochastic nature-inspired optimization techniques have been proposed in this book to efficiently handle the complex problems. The nature-inspired algorithms are classified as bio-inspired, swarm, and physics/chemical-based algorithms.

Socio-inspired is one of the subdomains of bio-inspired algorithms, and Cohort Intelligence (CI) models the social tendencies of learning candidates with an inherent goal to achieve the best possible position. In this book, CI is investigated by solving ten discrete variable truss structural problems, eleven mixed variable design engineering problems, seventeen linear and nonlinear constrained test problems and two real-world applications from manufacturing domain. Static Penalty Function (SPF) is also adopted to handle the linear and nonlinear constraints, and limitations in CI and SPF approaches are examined.

Constraint Handling in Cohort Intelligence Algorithm is a valuable reference to practitioners working in the industry as well as to students and researchers in the area of optimization methods.

A propos du livre

À propos de l?auteur

Ishaan R. Kale is a researcher for the Optimization and Agent Technology Research (OAT Research) Lab.

Anand J. Kulkarni is an Associate Professor at the Institute of Artificial Intelligence, MIT World Peace University, India.

Détails de l'édition

• Éditeur: CRC Press
• Date d'édition: 2021
• Langue: anglais
• ISBN 10: 1032150750
• ISBN 13: 9781032150758
• Reliure: Relié
• Nombre de pages: 200
• Coordonnées du fabricant: non disponible
• Personne responsable: gpsr@libri.de; gpsr@libri.de; ; Friedensallee 273; Hamburg; 22763; Allemagne