A Tabu Search Algorithm for the Steiner Tree Problem.

Show full item record

Title: A Tabu Search Algorithm for the Steiner Tree Problem.
Author: Kulkarni, Girish
Advisors: Dr. Yahya Fathi, Committee Chair
Dr Stephen Roberts, Committee Member
Dr. George Rouskas, Committee Member
Abstract: The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems. We survey, briefly, a few exact methods and a few heuristic approaches that have been proposed for solving this problem. Further, we propose a tabu search algorithm whose key feature includes a neighborhood definition consisting of exchange of key paths. The algorithm is empirically tested by running computational experiments on problem sets, with known optimal values, that are available over the internet. The results from the tabu search are compared with the optimal values and with the results of a well-known heuristic procedure. The experimental results show that the tabu search algorithm is reasonably successful. It produces near-optimal solutions in the experiments conducted and performs better than the heuristic procedure. We also explore other avenues for future work and possible extensions to the tabu search algorithm.
Date: 2002-09-04
Degree: MS
Discipline: Operations Research
URI: http://www.lib.ncsu.edu/resolver/1840.16/2754

Files in this item

Files Size Format View
etd.pdf 609.6Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record