Name
Abstract | ||
|---|---|---|
This article deals with a minimum spanning tree (MST) problem with a nonlinear objective function. A tabu search (TS) algorithm is developed to solve the problem. Oscillation Strategy and diversification strategy are incorporated into the algorithm. Numerical experiments are provided to compare the performance of the proposed algorithm with that of genetic algorithms (GAs). The results of the experiments show the advantage of the proposed algorithm in terms of computational accuracy and time. |
Year | Venue | Keywords |
|---|---|---|
2007 | Lecture Notes in Engineering and Computer Science | minimum spanning tree problem,nonlinear objective function,tabu search,strategic oscillation |
Field | DocType | ISSN |
Mathematical optimization,Distributed minimum spanning tree,Search algorithm,Guided Local Search,Computer science,Prim's algorithm,Algorithm,Reverse-delete algorithm,Kruskal's algorithm,Tabu search,Minimum spanning tree | Conference | 2078-0958 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hideki Katagiri | 1 | 436 | 46.48 |
| Ichiro Nishizaki | 2 | 443 | 42.37 |
| Masatoshi Sakawa | 3 | 1123 | 146.27 |
| Kosuke Kato | 4 | 328 | 47.30 |
| Takeshi Uno | 5 | 12 | 1.35 |
| Tomohiro Hayashida | 6 | 29 | 11.56 |