Presentation 2010-12-13
Multi-swarm particle swarm optimization for constrained optimization problems
Kazuhiro HOMMA, Tadashi TSUBONE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this work, we have considered a multi-swarm Particle Swarm Optimization (abbr. PSO) in order to slove some constrained optimization problems. There are many approaches of PSO applied for a variety of constrained optimization problems. Especially, a penalty method which has been well-known to engineers is an effective technique for solving such problems. The penalty method transforms the objective function to an augmented objective function including constraint terms and weight parameters for applying some optimization methods for constrained optimization problems. The penalty method is simple and relatively easy to build into PSO, however adjusting the weight parameters is often depended on heuristics. This report proposes a novel multi-swarm PSO without the use of the augmented objective functions and provides numerical verification by using some benchmark problems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Particle Swarm Optimization / Constrained Optimization Problems
Paper # NLP2010-111
Date of Issue

Conference Information
Committee NLP
Conference Date 2010/12/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Multi-swarm particle swarm optimization for constrained optimization problems
Sub Title (in English)
Keyword(1) Particle Swarm Optimization
Keyword(2) Constrained Optimization Problems
1st Author's Name Kazuhiro HOMMA
1st Author's Affiliation Nagaoka University of Technology()
2nd Author's Name Tadashi TSUBONE
2nd Author's Affiliation Nagaoka University of Technology
Date 2010-12-13
Paper # NLP2010-111
Volume (vol) vol.110
Number (no) 335
Page pp.pp.-
#Pages 4
Date of Issue