An interval space reducing method for constrained problems with particle swarm optimization |
| |
Affiliation: | 1. School of energy and power engineering, Beihang University, Beijing 100191,China;2. Collaborative Innovation Center for Advanced Aero-Engine, Beijing 100191,China |
| |
Abstract: | In this paper, we propose a method for solving constrained optimization problems using interval analysis combined with particle swarm optimization. A set inverter via interval analysis algorithm is used to handle constraints in order to reduce constrained optimization to quasi unconstrained one. The algorithm is useful in the detection of empty search spaces, preventing useless executions of the optimization process. To improve computational efficiency, a space cleaning algorithm is used to remove solutions that are certainly not optimal. As a result, the search space becomes smaller at each step of the optimization procedure. After completing pre-processing, a modified particle swarm optimization algorithm is applied to the reduced search space to find the global optimum. The efficiency of the proposed approach is demonstrated through comprehensive experimentation involving 100 000 runs on a set of well-known benchmark constrained engineering design problems. The computational efficiency of the new method is quantified by comparing its results with other PSO variants found in the literature. |
| |
Keywords: | Interval analysis Evolutionary computation Particle swarm optimization Constrained optimization |
本文献已被 ScienceDirect 等数据库收录! |
|