Co-evolutionary particle swarm optimization to solve constrained optimization problems

✍ Scribed by Xiaoli Kou; Sanyang Liu; Jianke Zhang; Wei Zheng

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 504 KB
• Volume: 57
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/j.camwa.2008.10.013

✦ Synopsis

This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, based on the theory of extrapolation, the induction of evolving direction is enhanced by adding a co-evolutionary strategy, in which the particles make full use of the information each other by using gene-adjusting and adaptive focus-varied tuning operator. Infeasible degree selection mechanism is used to handle the constraints. A new selection criterion is adopted as tournament rules to select individuals. Also, the infeasible solution is properly accepted as the feasible solution based on a defined threshold of the infeasible degree. This diversity mechanism is helpful to guide the search direction towards the feasible region. Our approach was tested on six problems commonly used in the literature. The results obtained are repeatedly closer to the true optimum solution than the other techniques.