Advertisement

A Novel Multi-objective PSO Algorithm for Constrained Optimization Problems

  • Jingxuan Wei
  • Yuping Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann Publishers, SanFrancisco (2001)Google Scholar
  3. 3.
    Hernandez-Aguirre, A., Coello, C.: Passss: An Implementation of A Novel Diversity Strategy to Handle Constraints. In: Proceeding of the 2004 Congress on Evolutionary Computation CEC-2004, June 2004, vol. 1, pp. 403–410. IEEE press, Los Alamitos (2004)CrossRefGoogle Scholar
  4. 4.
    Aguirre, A.H., Rionda, S.B., Coello Coello, C.A.: Handling Constraints Using Multiobjective Optimization Concepts. International J. for Numerical Methods in Engineering 59, 1989–2017 (2004)zbMATHCrossRefGoogle Scholar
  5. 5.
    Coello Coello, C.A.: Constraint Handling Using an Evolutionary Multiobjective Optimization Technique. Civil Engineering Systems 17, 319–346 (2000)CrossRefGoogle Scholar
  6. 6.
    Zhou, Y., Li, Y., et al.: A Pareto Strength Evolutionary Algorithm for Constrained Optimization. Journal of Software 14, 1243–1249 (2003)zbMATHGoogle Scholar
  7. 7.
    Runarsson, T.P., Yao, X.: Stochastic Ranking for Constrained Evolutionary Optimization. IEEE Trans. On Evolutionary Computation 4(3), 284–292 (2000)CrossRefGoogle Scholar
  8. 8.
    Kim, J.-H., Myung, H.: Evolutionary Programming Techniques for Constrained Optimization. IEEE Transactions on Evolutionary Computation, 129–139 (April 1997)Google Scholar
  9. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jingxuan Wei
    • 1
  • Yuping Wang
    • 2
  1. 1.School of ScienceXidian UniversityXi’anChina
  2. 2.School of Computer Science and TechnologyXidian UniversityXi’anChina

Personalised recommendations