Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem by Diptesh Ghosh (Working Paper, No. 2003-07-02/1765)

By: Material type: TextTextPublication details: Ahmedabad Indian Institute of Management 2003 Description: 9 pSubject(s): DDC classification:
  • WP 2003-07-02 (1765)
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Working Paper Vikram Sarabhai Library WP 2003-07-02 (1765) (Browse shelf(Opens below)) Available WP001765

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.

There are no comments on this title.

to post a comment.