# Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems

• Hideki Katagiri
• Masatoshi Sakawa
• Kosuke Kato
• Ichiro Nishizaki
• Takeshi Uno
• Tomohiro Hayashida
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 5)

The minimum spanning tree (MST) problem is to find the least cost spanning tree in an edge-weighted graph. In the real world, MST problems are usually seen in network optimization. For instance, when designing a layout for telecommunication systems, if a decision maker prefers to minimize the total cost for connection between cities or sections, it is formulated as an MST problem. In other examples, the objective is to minimize the total time for construction or to maximize the network reliability.

In classical MST problems, weights attached to edges are constant, and all the weights are independent of each other. In other words, the objective function is linear. Polynomial–time algorithms for solving a usual MST problem were first constructed by Kruskal [1] and Prim [2]. Gabow et al. [3] and Chazelle [4] developed more efficient algorithms.

This paper is organized as follows: Section 2 formulates a nonlinear MST problem. In Section 3, we propose a solution algorithm using TS. Section 4 provides numerical experiments and shows the advantage of our algorithm over the algorithm using a GA.

## Keywords

Local Search Span Tree Tabu Search Tabu List Tabu Search Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
J.B. Kruskal (1956) On the shortest spanning subtree and the traveling salesman problem, Proceedings of the American Mathematical Society, 7: 48-50.
2. 2.
R.C. Prim (1957) Shortest connection networks and some generalisations. Bell System Tech-nical Journal, 36: 1389-1401.Google Scholar
3. 3.
H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan (1986) Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica,6: 109-122.
4. 4.
B. Chazelle (2000) A minimum spanning tree algorithm with inverse-Ackermann type com-plexity. Journal of the ACM, 47: 1028-1047.
5. 5.
H. Katagiri and H. Ishii (2000) Chance constrained bottleneck spanning tree problemwith fuzzy random edge costs, Journal of the Operations Research Society of Japan, 43: 128-137.
6. 6.
H. Katagiri, M. Sakawa, and H. Ishii (2004) Fuzzy random bottleneck spanning tree problems. European Journal of Operational Research, 152: 88-95.
7. 7.
H. Katagiri, E.B. Mermri, M. Sakawa, K. Kato, and I. Nishizaki (2005) A possibilistic and stochastic programming approach to fuzzy random MST problems. IEICE Transaction on Information and Systems, E88-D: 1912-1919.
8. 8.
G. Zhou and M. Gen (1998) An efficient genetic algorithm approach to the quadratic minimum spanning tree problem. Computers & Operations Research, 25: 229-237.
9. 9.
C. Blum and M.J. Blesa (2005) New metaheuristic approaches for the edge-weighted kcardinality tree problem. Computers & Operations Research, 32: 1355-1377.
10. 10.
F. Glover and M. Laguna (1997) Tabu search. Kluwer Academic Publishers, Norwell, MA.
11. 11.
S. Hanafi and A. Freville (1998) An efficient tabu search approach for the0-1 multidimensional knapsack problem. European Journal of Operational Research,106: 659-675.

## Authors and Affiliations

• Hideki Katagiri
• 1
• Masatoshi Sakawa
• 1
• Kosuke Kato
• 1
• Ichiro Nishizaki
• 1
• Takeshi Uno
• 1
• Tomohiro Hayashida
• 1
1. 1.Graduate School of EngineeringHiroshima UniversityJapan