An innovative hybrid multi-objective particle swarm optimization with or without constraints handling

• A new hybrid optimizer is proposed in which an innovative local optimal particles search strategy, which on basis of particular analysis on disadvantage of global optimal particle method, is integrated into multi-objective particle swarm optimization.
• Select some non-dominated solutions lied in less-crowded region of external archive and make full use of optimal particles method to guide these solutions approach the Pareto front quickly.
• The multi-dimensional uniform mutation operator is performed to prevent algorithm from trapping into local optimum and a dynamic archive maintenance strategy is applied to improve the diversity of solutions.
• For coping with the constrained conditions consist in objective functions, we adopt an efficient infeasibility degree evaluation criterion to deal with these complex problems.

This paper presents a new hybrid optimizer in which an innovative optimal particles local search strategy on basis of bound optimization by quadratic approximation (BOBYQA) algorithm and exterior penalty function method is integrated into particle swarm optimization (PSO). The main goal of the approach is to improve the convergence performance of PSO, and preserve the diversity of non-dominated set. Our algorithm selects some non-dominated solutions lied in less-crowded region of external archive based upon crowding distance value to construct a leader particles set, and make full use of optimal particles method to guide leader particles approach the Pareto front quickly. Meanwhile, a local optimal particles search strategy is proposed after particular analysis on disadvantage of global optimal particle search method, and names our algorithm as LOPMOPSO. Furthermore, the multi-dimensional uniform mutation operator is performed to prevent algorithm from trapping into local optimum, and a dynamic archive maintenance strategy is applied to improve the diversity of solutions. For coping with the constrained conditions consists in objective functions, we adopt an efficient infeasibility degree evaluation criterion to deal with these complex problems. Simulation results of various kinds of benchmark functions show that our approach is highly competitive in convergence speed and generates a well distributed and accurate set of non-dominated solutions easily. The solving of a 2-D aerodynamic optimization problem further validates its speed and effectiveness.

Figure optionsDownload as PowerPoint slide