A Method for Mixed Integer Programming Problems by Particle Swarm Optimization
-
- Kitayama Satoshi
- Kanazawa University
-
- Yasuda Keiichiro
- Tokyo Metropolitan University
Bibliographic Information
- Other Title
-
- Particle Swarm Optimizationによる混合整数計画問題の一解法
- Particle Swarm Optimization ニ ヨル コンゴウ セイスウ ケイカク モンダイ ノ イチカイホウ
Search this article
Abstract
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.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 125 (5), 813-820, 2005
The Institute of Electrical Engineers of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679582195584
-
- NII Article ID
- 10015555460
- 10015518367
-
- NII Book ID
- AN10065950
-
- BIBCODE
- 2005ITEIS.125..813K
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 7342506
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed