Name
Title | ||
|---|---|---|
A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems |
Abstract | ||
|---|---|---|
This paper considers an efficient approximate algorithm for solving k -minimum spanning tree problems which is one of the combinatorial optimization in networks. A new hybrid algorithm based on tabu search and ant colony optimization is provided. Results of numerical experiments show that the proposed method updates some of the best known values and that the proposed method provides a relatively better performance with solution accuracy over existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04820-3_29 | MDAI |
Keywords | Field | DocType |
ant colony optimization,known value,solution accuracy,k-minimum spanning tree problems,new hybrid algorithm,combinatorial optimization,tabu search,numerical experiment,efficient approximate algorithm,better performance,hybrid algorithm,ant colony,minimum spanning tree | Ant colony optimization algorithms,Mathematical optimization,Search algorithm,Distributed minimum spanning tree,Computer science,Meta-optimization,Combinatorial optimization,Artificial intelligence,Machine learning,Tabu search,Minimum spanning tree,Metaheuristic | Conference |
Volume | ISSN | Citations |
5861 | 0302-9743 | 2 |
PageRank | References | Authors |
0.37 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hideki Katagiri | 1 | 436 | 46.48 |
| Tomohiro Hayashida | 2 | 29 | 11.56 |
| Ichiro Nishizaki | 3 | 443 | 42.37 |
| Jun Ishimatsu | 4 | 6 | 0.93 |