An Approximate Solution Method Based on Particle Swarm Optimization for Nonlinear Programming Problems

Bibliographic Information

Other Title
  • 非線形計画問題に対するParticle Swarm Optimizationに基づく近似解法
  • ヒセンケイ ケイカク モンダイ ニ タイスル Particle Swarm Optimization ニ モトズク キンジ カイホウ

Search this article

Abstract

In this paper, focusing on nonlinear programming problems involving constraints, we attempt to propose a general-purpose and high-performance approximate solution method for them. In recent years, as general-purpose approximate solution methods for nonlinear programming problems, the particle swarm optimization (PSO) method has drawn considerable attention. However, there exist few reports with respect to successful results for constrained nonlinear programming problems by PSO-based methods. Furthermore, the PSO-based methods have a shortcoming that the search is liable to stopping at a certain local solution. Thereby, we incorporate the bisection method and a homomorphous mapping to carry out the search considering constraints. In addition, we incorporate a multiple stretching and secession into PSO method for restraining the stopping at a certain local solution. Furthermore, we show the efficiency of the proposed revised PSO method (rPSO) by comparing it with two existing methods such as GENOCOPV and αPSO through the application of them into the numerical examples.

Journal

Citations (2)*help

See more

References(13)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top