A Tabu Search Algorithm for the Steiner Tree Problem.

Show simple item record

dc.contributor.advisor Dr. Yahya Fathi, Committee Chair en_US
dc.contributor.advisor Dr Stephen Roberts, Committee Member en_US
dc.contributor.advisor Dr. George Rouskas, Committee Member en_US
dc.contributor.author Kulkarni, Girish en_US
dc.date.accessioned 2010-04-02T18:17:11Z
dc.date.available 2010-04-02T18:17:11Z
dc.date.issued 2002-09-04 en_US
dc.identifier.other etd-09032002-115648 en_US
dc.identifier.uri http://www.lib.ncsu.edu/resolver/1840.16/2754
dc.description.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. en_US
dc.rights I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. en_US
dc.subject Steiner Tree en_US
dc.subject Tabu Search en_US
dc.subject meta-heuristics en_US
dc.title A Tabu Search Algorithm for the Steiner Tree Problem. en_US
dc.degree.name MS en_US
dc.degree.level thesis en_US
dc.degree.discipline Operations Research en_US

Files in this item

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

This item appears in the following Collection(s)

Show simple item record