書誌事項
- タイトル別名
-
- A Method for Mixed Integer Programming Problems by Particle Swarm Optimization
- Particle Swarm Optimization ニ ヨル コンゴウ セイスウ ケイカク モンダイ ノ イチカイホウ
この論文をさがす
抄録
Particle Swarm Optimization (PSO) for mixed integer programming problems is proposed. PSO is mainly a method to find a global or quasi-minimum for a nonlinear and non-convex optimization problem, and few researches about optimization problems with discrete decision variables have been studied. In this paper, we present the treatment of discrete decision variables. To treat discrete decision variables as a penalty function, it is possible to treat all decision variables as a continuous decision variable. As a result, the penalty parameter for the penalty function is needed. In this paper, we also present how to determine the penalty parameter for the penalty function. Through mathematical and structural optimization problems, we examine the validity of PSO for the mixed decision variables.
収録刊行物
-
- 電気学会論文誌Ｃ（電子・情報・システム部門誌）
-
電気学会論文誌Ｃ（電子・情報・システム部門誌） 125 (5), 813-820, 2005
一般社団法人 電気学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679582195584
-
- NII論文ID
- 10015555460
- 10015518367
-
- NII書誌ID
- AN10065950
-
- BIBCODE
- 2005ITEIS.125..813K
-
- ISSN
- 13488155
- 03854221
-
- NDL書誌ID
- 7342506
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可