A filter-and-fan algorithm for the capacitated minimum spanning tree problem

The capacitated minimum spanning tree (CMST) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solutions. This paper proposes a new CMST heuristic algorithm that effectively combines the classical node-based and tree-based neighborhoods embodied in a filter-and-fan (F&F) approach, a local search procedure that generates compound moves in a tree search fashion. The overall algorithm is guided by a multi-level oscillation strategy used to trigger each type of neighborhood while allowing the search to cross feasibility boundaries. Computational results carried out on a standard set of 135 benchmark problems show that a simple F&F design competes effectively with prior CMST metaheuristics, rivaling the best methods, which are significantly more complex.

[1]  Stefan Voß,et al.  Capacitated minimum spanning trees: algorithms using intelligent search , 1995 .

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  Dushyant Sharma,et al.  Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem , 2001, Math. Program..

[4]  Michel Gendreau,et al.  A TABU SEARCH ALGORITHM FOR THE CAPACITATED SHORTEST SPANNING TREE PROBLEM. , 1997 .

[5]  Dicky C. K. Yan,et al.  Designing tributary networks with multiple ring families , 1998, Comput. Oper. Res..

[6]  Stefan Voß,et al.  Capacitated Minimum Spanning Trees , 2009, Encyclopedia of Optimization.

[7]  F. Glover,et al.  Local Search and Metaheuristics , 2007 .

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

[9]  K. Mani Chandy,et al.  The Design or Multipoint Linkages in a Teleprocessing Tree Network , 1972, IEEE Transactions on Computers.

[10]  Erik Rolland,et al.  A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem , 1999, J. Heuristics.

[11]  Erik Rolland,et al.  Memory Adaptive Reasoning & Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problem , 1999 .

[12]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[13]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..

[14]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[15]  Kenneth A. De Jong,et al.  Artificial Evolution , 2021, Lecture Notes in Computer Science.

[16]  S. Raghavan,et al.  The Multilevel Capacitated Minimum Spanning Tree Problem , 2006, INFORMS J. Comput..

[17]  Susan L. Albin,et al.  The design of centralized networks with reliability and availability constraints , 1988, Comput. Oper. Res..

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

[20]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[21]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[22]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[23]  Dushyant Sharma,et al.  A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem , 2003, Oper. Res. Lett..

[24]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[25]  Rakesh Kawatra,et al.  A multiperiod planning model for the capacitated minimal spanning tree problem , 2000, Eur. J. Oper. Res..

[26]  Fred W. Glover,et al.  RAMP for the capacitated minimum spanning tree problem , 2010, Ann. Oper. Res..

[27]  Stefan Voß,et al.  Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees , 2000, Eur. J. Oper. Res..