## Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem (2000)

Venue: | MATHEMATICAL PROGRAMMING |

Citations: | 11 - 3 self |

### BibTeX

@ARTICLE{Ahuja00multi-exchangeneighborhood,

author = {Ravindra K. Ahuja and James B. Orlin and Dushyant Sharma},

title = {Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem},

journal = {MATHEMATICAL PROGRAMMING},

year = {2000},

volume = {91},

pages = {2001}

}

### OpenURL

### Abstract

The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The CMST problem is an NP-complete problem, and existing exact algorithms can solve only small size problems. Currently, the best available heuristic procedures for the CMST problem are tabu search algorithms due to Amberg et al. and Sharaiha et al. These algorithms use two-exchange neighborhood structures that are based on exchanging a single node or a set of nodes between two subtrees. In this paper, we generalize their neighborhood structures to allow exchanges of nodes among multiple subtrees simultaneously; we refer to such neighborhood structures as multi-exchange neighborhood structures. Our first multiexchange neighborhood structure allows exchanges of single nodes among several subtrees. Our second multi-exchange neighborhood structure allows exchanges that involve multiple subtrees. The size of each of these neighborhood structures grows exponentially with the problem size without any substantial increase in the computational times needed to find improved neighbors. Our approach, which is based on the cyclic transfer neighborhood structure due to Thompson and Psaraftis and Thompson and Orlin transforms a profitable exchange into a negative cost subset-disjoint cycle in a graph, called an improvement graph, and identifies these cycles using variants of shortest path label-correcting algorithms. Our computational results with GRASP and tabu search algorithms based on these neighborhood structures reveal that (i) for the unit demand case our algorithms obtained the best available solutions for all benchmark instances and improved some; and (ii) for the heterogeneous deman...