Please use this identifier to cite or link to this item:
|Title:||Swarm Algorithm for Single- and Multiobjective Airfoil Design Optimization||Authors:||Ray, T.
|Issue Date:||Feb-2004||Citation:||Ray, T.,Tsai, H.M. (2004-02). Swarm Algorithm for Single- and Multiobjective Airfoil Design Optimization. AIAA Journal 42 (2) : 366-373. ScholarBank@NUS Repository.||Abstract:||Shape optimization of airfoils involves highly expensive, nonlinear objective(s) and constraint functions often with functional and slope discontinuity that limits the efficient use of gradient-based methods for its solution. Gradient-based methods are not capable of generating a set of pareto solutions as required in multiobjective problems as they work with a single solution and improve it through successive iterations. Population-based, zero-order, stochastic optimization methods are therefore an attractive choice for shape optimization problems as they are easy to implement and effective for highly nonlinear problems. We present a swarm algorithm that is applicable for optimization problems in general, but is here explored for airfoil design optimization studies. The algorithm is based on a sociobehavioral model, and it offers the designer the desired flexibility to solve various unconstrained/constrained, single-/multiobjective forms of the airfoil shape optimization problem. The algorithm handles objectives and constraints separately via pareto ranking and is thus immune to problems of scaling and aggregation that commonly affect penalty-function-based constraint handling schemes. Three different airfoil design optimization problems have been solved to illustrate the algorithm's flexibility and its computational efficiency, which compare favorably with existing stochastic search methods.||Source Title:||AIAA Journal||URI:||http://scholarbank.nus.edu.sg/handle/10635/115305||ISSN:||00011452|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 27, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.