このエントリーをはてなブックマークに追加
ID 25618
本文ファイル
著者
Kato, Kosuke
Matsumoto, Koichi
NDC
技術・工学
抄録(英)
In this research, focusing on nonlinear integer programming problems, we propose an approximate solution method based on particle swarm optimization proposed by Kennedy et al. And we developed a new particle swarm optimization method which is applicable to discrete optimization problems by incoporating a new method for generating initial search points, the rounding of values obtained by the move scheme and the revision of move methods. Furthermore, we showed the efficiency of the proposed particle swarm optimization method by comparing it with an existing method through the application of them into the numerical examples. Moreover we expanded revised particle swarm optimization method for application to nonlinear integer programming problems and showed more effeciency than genetic algorithm. However, variance of the solutions obtained by the PSO method is large and accuracy is not so high. Thus, we consider improvement of accuracy introducing diversification and intensification.
掲載誌名
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
開始ページ
43
終了ページ
47
出版年月日
2008-12
出版者
IEEE SMC Hiroshima Chapter
ISSN
1883-3977
言語
英語
NII資源タイプ
会議発表論文
広大資料タイプ
会議発表論文
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
publisher
権利情報
(c) Copyright by IEEE SMC Hiroshima Chapter.
部局名
工学研究科