制約条件付き0-1組合せ最適化問題に対するPSOを用いた進化型解法

カテゴリ: 論文誌(論文単位)

グループ名: 【C】電子・情報・システム部門

発行日: 2012/07/01

タイトル(英語): Evolutional Solutions by Using PSO for 0-1 Combinatorial Optimization Problems with Constraints

著者名: 小川　直明（慶應義塾大学理工学部），相吉　英太郎（慶應義塾大学理工学部）

著者名(英語): Naoaki Ogawa (Faculty of Science and Technology, Keio University), Eitaro Aiyoshi (Faculty of Science and Technology, Keio University)

キーワード: 大域的最適化，進化計算，0-1 組合せ最適化問題，割当て型等式制約，ナップサック型不等式制約　　global optimization，evolutional computing，0-1 combinatorial optimization problems，allocation type equality constraints，knapsack type inequality constraints

要約(英語): In this paper, as one of global optimization methods for 0-1 combinatorial optimization problems with constraints, a continuous relaxation approach is presented, in which the continuous variables are transformed into binary variables through a sorting procedure of continuous variables taking the constraints into consideration. The new type of relaxation approach enables us to apply Particle Swarm Optimization, which is effective heuristic method for global optimization with continuous variables. Here, our presented approach is interpreted as one of evolutional computing methods because the transformation of continuous variables into binary ones corresponds to transform genotype into phenotype, which is reverse to a relation in usual evolutional computing.

本誌: 電気学会論文誌C（電子・情報・システム部門誌） Vol.132 No.7 （2012） 特集：平成23年電気学会電子・情報・システム部門大会

本誌掲載ページ: 1136-1143 p

原稿種別: 論文／日本語

電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/132/7/132_1136/_article/-char/ja/