An approximate solution method based on tabu search for k-minimum spanning tree problems
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
Page 159-164
published_at 2008-12
アクセス数 : 803 件
ダウンロード数 : 250 件
今月のアクセス数 : 1 件
今月のダウンロード数 : 0 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00025641
| File | |
| Title ( eng ) |
An approximate solution method based on tabu search for k-minimum spanning tree problems
|
| Creator |
Ishimatsu Jun
Nishizaki Ichiro
Hayashida Tomohiro
|
| Source Title |
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
|
| Start Page | 159 |
| End Page | 164 |
| Abstract |
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 |
Technology. Engineering [ 500 ]
|
| Language |
eng
|
| Resource Type | conference paper |
| Publisher |
IEEE SMC Hiroshima Chapter
|
| Date of Issued | 2008-12 |
| Rights |
(c) Copyright by IEEE SMC Hiroshima Chapter.
|
| Publish Type | Version of Record |
| Access Rights | open access |
| Source Identifier |
[ISSN] 1883-3977
|
