Constraint Handling in Cohort Intelligence Algorithm
Versandkostenfrei!
Versandfertig in 1-2 Wochen
193,99 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
97 °P sammeln!
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 inhe...
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.
Andere Kunden interessierten sich für
