An approximate solution method based on tabu search for k-minimum spanning tree problems
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
159-164 頁
2008-12 発行
アクセス数 : 794 件
ダウンロード数 : 247 件
今月のアクセス数 : 5 件
今月のダウンロード数 : 3 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00025641
| ファイル情報(添付) | |
| タイトル ( eng ) |
An approximate solution method based on tabu search for k-minimum spanning tree problems
|
| 作成者 |
Ishimatsu Jun
Nishizaki Ichiro
Hayashida Tomohiro
|
| 収録物名 |
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
|
| 開始ページ | 159 |
| 終了ページ | 164 |
| 抄録 |
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.
|
| NDC分類 |
技術・工学 [ 500 ]
|
| 言語 |
英語
|
| 資源タイプ | 会議発表論文 |
| 出版者 |
IEEE SMC Hiroshima Chapter
|
| 発行日 | 2008-12 |
| 権利情報 |
(c) Copyright by IEEE SMC Hiroshima Chapter.
|
| 出版タイプ | Version of Record（出版社版。早期公開を含む） |
| アクセス権 | オープンアクセス |
| 収録物識別子 |
[ISSN] 1883-3977
|
