An approximate solution method based on tabu search for k-minimum spanning tree problems
11-08-PS080004.pdf 426 KB
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.
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
|date of issued||
IEEE SMC Hiroshima Chapter
(c) Copyright by IEEE SMC Hiroshima Chapter.
Graduate School of Engineering