A Novel Multi-objective PSO Algorithm for Constrained Optimization Problems
A new approach is presented to handle constrained optimization by using PSO algorithm. It neither uses any penalty function in the proposed PSO algorithms. The new technique treats constrained optimization as a two-objective optimization, one objective is original objective function, and the other is the degree violation of constraints. As we prefer the second objective, a new crossover operator is designed based on the three-parent crossover operator, which will lead the degree violation of constraints to zero. Then, in order to keep the diversity of the swarm and escape from the local optimum easily, we design a dynamically changing inertia weight. The simulation results indicate the proposed algorithm is effective.
Unable to display preview. Download preview PDF.
- 1.Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. IV, pp. 1941–1948. IEEE Service Center, Piscataway, NJ (1995)Google Scholar
- 2.Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann Publishers, SanFrancisco (2001)Google Scholar
- 8.Kim, J.-H., Myung, H.: Evolutionary Programming Techniques for Constrained Optimization. IEEE Transactions on Evolutionary Computation, 129–139 (April 1997)Google Scholar
- 9.Joines, Houck, C.: On the Use of Non-Stationary Penalty Function to Solve Nonlinear Constrained Optimization Problems with Gas. In: Proceedings of the First IEEE International Conference on Evolutionary Computation, pp. 579–584. IEEE press, Piscataway, NJ (1994)Google Scholar