A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem

Diptesh Ghosh ()

No 2003-07-02, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly corresponds to its probability of being included in an optimal solution, and to use such probability values to shrink the size of the neighborhood of solutions to manageable proportions. We report results from computational experiments that demonstrate the superiority of this method over the generic tabu search method.

New Economics Papers: this item is included in nep-cmp
Date: 2003-07-03
View list of references

Downloads: (external link)
http://www.iimahd.ernet.in/publications/data/2003-07-02DipteshGhosh.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:iim:iimawp:2003-07-02

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department
Contact information at EDIRC.
Series data maintained by ().