Two-Stage Adaptive Constrained Particle Swarm Optimization Based on Bi-Objective Method

For the sake of better balancing the relationship between diversity and convergence when handling constrained optimization problems, a two-stage adaptive constrained particle swarm optimization algorithm based on bi-objective method (TABC-PSO) is proposed. In accordance with different phases of the constraint process, the target-constraint space derived from the angle is partitioned adaptively, and simultaneously the global best particle is selected and the external archive set is safeguarded. In the first stage, the whole space is divided adaptively in term of the angular distribution of individual, and the feasible region is explored comprehensively. In the second stage, local regions are adaptively compartmentalized and in-depth exploitation is carried out. Primary and secondary external archive sets are established to maintain population diversity and accelerate convergence. The two phases are switched adaptively in light of the storage status of the two external archive sets. We evaluated TABC-PSO algorithm on the benchmark functions in CEC 2006 and CEC 2017. The experimental results show that TABC-PSO algorithm compared with other state-of-the-art algorithms can be superior to applied to test functions with different types of constraints and possesses a competitive search capability.