ID | 14824 |
Eprint ID | 14824
|
フルテキストURL | |
著者 |
Ishimatsu Jun
Hiroshima University
Katagiri Hideki
Hiroshima University
Nishizaki Ichiro
Hiroshima University
Hayashida Tomohiro
Hiroshima University
|
抄録 | This paper considers k-minimum spanning tree
problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a local optimal solution of k-minimum spanning tree problems. This article provides a new tabu-searchbased approximate solution method that does not iteratively solve minimum spanning tree problems. Results of numerical experiments show that the proposed method provides a good performance in terms of accuracy over those of existing methods for relatively high cardinality k.
|
発行日 | 2008-12-11
|
出版物タイトル |
Proceedings : Fourth International Workshop on Computational Intelligence & Applications
|
巻 | 2008巻
|
号 | 1号
|
出版者 | IEEE SMC Hiroshima Chapter
|
開始ページ | 159
|
終了ページ | 164
|
ISSN | 1883-3977
|
資料タイプ |
会議発表論文
|
言語 |
英語
|
イベント | Fourth International Workshop on Computational Intelligence & Applications IEEE SMC Hiroshima Chapter : IWCIA 2008
|
イベント地 | 東広島市
|
イベント地の別言語 | Higashi-Hiroshima City
|
論文のバージョン | publisher
|
査読 |
有り
|
Eprints Journal Name | IWCIA
|