A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design

作者：Poole Daniel J^*; Allen Christian B; Rendall Thomas C S

来源：Optimization and Engineering, 2017, 18(3): 659-691.

DOI：10.1007/s11081-016-9343-0

• Optimization
• Constraint handling
• Swarm algorithms
• Aerodynamic shape optimization

A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling frameworks are often not universally applicable to all swarm algorithms. A constraint handling framework is therefore presented in this paper that is compatible with any swarm optimizer, such that a user can wrap it around a chosen swarm algorithm and perform constrained optimization. The method, called separation-sub-swarm, works by dividing the population based on the feasibility of individual agents. This allows all feasible agents to move by existing swarm optimizer algorithms, hence promoting good performance and convergence characteristics of individual swarm algorithms. The framework is tested on a suite of analytical test function and a number of engineering benchmark problems, and compared to other generic constraint handling frameworks using four different swarm optimizers; particle swarm, gravitational search, a hybrid algorithm and differential evolution. It is shown that the new framework produces superior results compared to the established frameworks for all four swarm algorithms tested. Finally, the framework is applied to an aerodynamic shape optimization design problem where a shock-free solution is obtained.

• 出版日期2017-9