Heuristics for the multi-level capacitated minimum spanning tree problem

The capacitated minimum spanning tree (CMST) problem is fundamental to the design of centralized communication networks. In this paper we consider the multi-level capacitated minimum spanning tree problem, a generalization of the well-known CMST problem. Based on work previously done in the field, three heuristics are presented, addressing unit and non-unit demand cases. The proposed heuristics have been also integrated into a mixed integer programming solver. Evaluation results are presented, for an extensive set of experiments, indicating the improvements that the heuristics bring to the particular problem.

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

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

[3]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[4]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Luís Gouveia,et al.  A comparison of directed formulations for the capacitated minimal spanning tree problem , 1993, Telecommun. Syst..

[6]  S. Raghavan,et al.  An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem , 2003 .

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

[8]  Iakovos S. Venieris,et al.  Particle swarm optimization for the multi level capacitated minimum spanning tree , 2009, 2009 International Multiconference on Computer Science and Information Technology.

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

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

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

[12]  Marcone J. F. Souza,et al.  GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem , 2009, J. Heuristics.

[13]  Alexandre Xavier Martins,et al.  Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem , 2012, Networks.

[14]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.