A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data

This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of graphs are performed. The obtained results suggest that the proposed tabu search algorithm quickly outputs optimal solutions for the smaller instances, previously discussed in the existing literature. Furthermore, some arguments that this algorithm performs well also for larger instances are provided.

[1]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[2]  Pascal Van Hentenryck,et al.  On the complexity of the robust spanning tree problem with interval data , 2004, Oper. Res. Lett..

[3]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[4]  G. Cottafava,et al.  Invariance properties of central trees , 1971 .

[5]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[6]  Hande Yaman,et al.  The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..

[7]  Adam Kasperski,et al.  On combinatorial optimization problems on matroids with uncertain weights , 2007, Eur. J. Oper. Res..

[8]  Yury Nikulin.  Simulated annealing algorithm for the robust spanning tree problem , 2008, J. Heuristics.

[9]  Roberto Montemanni.  A Benders decomposition approach for the robust spanning tree problem with interval data , 2006, Eur. J. Oper. Res..

[10]  Igor Averbakh,et al.  Interval data minmax regret network optimization problems , 2004, Discret. Appl. Math..

[11]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[12]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[13]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[14]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[15]  Roberto Montemanni,et al.  A branch and bound algorithm for the robust shortest path problem with interval data , 2004, Oper. Res. Lett..

[16]  Jørgen Bang-Jensen,et al.  Heuristics for the central tree problem , 2010, J. Heuristics.

[17]  Roberto Montemanni,et al.  A branch and bound algorithm for the robust spanning tree problem with interval data , 2002, Eur. J. Oper. Res..

[18]  Narsingh Deo.  A Central Tree , 1966 .

[19]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[20]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[21]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[22]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[23]  Sergei L. Bezrukov,et al.  On Central Spanning Trees of a Graph , 1995, Combinatorics and Computer Science.

[24]  János Barta,et al.  The Robust Traveling Salesman Problem with Interval Data , 2006, Transp. Sci..

[25]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[26]  A. Kasperski,et al.  Minimizing maximal regret in discrete optimization problems with interval data , 2004 .

[27]  Adam Kasperski,et al.  An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..

[28]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[29]  Pascal Van Hentenryck,et al.  A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data , 2002, UAI.