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 with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.eswa.2011.11.103 | Expert Syst. Appl. |
Keywords | Field | DocType |
tabu search,short time,ant colony optimization,numerical experiment,tree problem,known value,solution accuracy,new hybrid algorithm,efficient approximate algorithm,better performance,combinatorial optimization,hybrid algorithm | Ant colony optimization algorithms,Mathematical optimization,Search algorithm,k-minimum spanning tree,Computer science,Meta-optimization,Combinatorial optimization,Artificial intelligence,Spanning tree,Tabu search,Machine learning,Metaheuristic | Journal |
Volume | Issue | ISSN |
39 | 5 | 0957-4174 |
Citations | PageRank | References |
6 | 0.48 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hideki Katagiri | 1 | 436 | 46.48 |
| Tomohiro Hayashida | 2 | 29 | 11.56 |
| Ichiro Nishizaki | 3 | 443 | 42.37 |
| Qingqiang Guo | 4 | 7 | 1.84 |