Advertisement

Nonlinear Programming Based on Particle Swarm Optimization

  • Takeshi Matsui
  • Kosuke Kato
  • Masatoshi Sakawa
  • Takeshi Uno
  • Kenji Morihara
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 5)

Actual optimization problems to find a solution optimizing a certain objective function under given constraints are often formulated as nonlinear programming problems. If both the objective function and the constrained region are convex, the problem is called a convex programming problem. For convex programming problems, efficient optimization methods such as the sequential quadratic programming method, the generalized reduced gradient method, and so forth, have been proposed. On the other hand, there has been established no efficient optimization method for nonconvex nonlinear programming problems.

In recent years, metaheuristics such as simulated annealing and genetic algorithm have drawn considerable attention. For example, RGENOCOP V that is the floating point type genetic algorithm introducing updating of a basepoint solution of homomorphism to generate initial population is propsed and its effectiveness is shown in [1]. However, since optimization problems in the real world become larger and more complicated, a high speed and accurate optimization method is expected.

In this research, to deal with these drawbacks of the original PSO methods, we incorporate the bisection method and a homomorphous mapping to carry out the search considering constraints. In addition, we propose the multiple stretching technique and modified move schemes of particles to restrain the stopping around local optimal solutions.

Keywords

Search Point Nonlinear Programming Problem Local Optimal Solution Move Scheme Bisection Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Kennedy and R.C. Eberhart (1995) Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, pp. 1942-1948.Google Scholar
  2. 2.
    J. Kennedy and W.M. Spears (1998) Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal prob-lem generator. Proceedings of IEEE International Conference Evolutionary Computation, pp. 74-77.Google Scholar
  3. 3.
    S. Koziel and Z. Michalewicz (1999) Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 7(1):19-44.CrossRefGoogle Scholar
  4. 4.
    K.E. Parsopoulos and M.N. Varahatis (2002) Recent approaches to global optimization problems through Particle Swarm Optimization. Natural Computing, (1):235-306.Google Scholar
  5. 5.
    M. Sakawa, K. Kato, and T. Suzuki (2002) An interactvie fuzzy satisficing method for multiobjective non-convex programming problems through genetic algorithms. Proceedings of 8th Japan Society for Fuzzy Theory and Systems, Chugoku/Shikoku Branch Office Meeting, pp. 33-36.Google Scholar
  6. 6.
    Y.H. Shi and R.C. Eberhart (1998) A modified particle swarm optimizer. Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69-73.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Takeshi Matsui
    • 1
  • Kosuke Kato
    • 1
  • Masatoshi Sakawa
    • 1
  • Takeshi Uno
    • 1
  • Kenji Morihara
    • 1
  1. 1.Graduate School of EngineeringHiroshima UniversityJapan

Personalised recommendations