RAMP for the capacitated minimum spanning tree problem

This paper introduces dual and primal-dual RAMP algorithms for the solution of the capacitated minimum spanning tree problem (CMST). A surrogate constraint relaxation incorporating cutting planes is proposed to explore the dual solution space. In the dual RAMP approach, primal-feasible solutions are obtained by simple tabu searches that project dual solutions onto primal feasible space. A primal-dual approach is achieved by including a scatter search procedure that further exploits the adaptive memory framework. Computational results from applying the methods to a standard set of benchmark problems disclose that the dual RAMP algorithm finds high quality solutions very efficiently and that its primal-dual enhancement is still more effective.

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

[2]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

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

[6]  Toshihide Ibaraki,et al.  A 3-flip neighborhood local search for the set covering problem , 2006, Eur. J. Oper. Res..

[7]  Fred Glover.  Adaptive Memory Projection Methods for Integer Programming , 2005 .

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

[9]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[10]  Marcus Poggi de Aragão,et al.  Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation , 2007, Math. Program..

[11]  Marco Caserta,et al.  Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems , 2007, Metaheuristics.

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

[13]  Ramesh Sharda,et al.  Metaheuristic Optimization via Memory and Evolution , 2005 .

[14]  Roman Orus.  Two slightly-entangled NP-complete problems , 2005, Quantum Inf. Comput..

[15]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..

[16]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[17]  David P. DiVincenzo,et al.  Quantum information and computation , 2000, Nature.

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

[19]  Tore Grünert.  Lagrangean Tabu Search , 2002 .

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

[21]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .

[22]  Leslie Hall,et al.  Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem , 1996, INFORMS J. Comput..

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

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

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

[26]  Kavindra Malik,et al.  A branch and bound algorithm for the capacitated minimum spanning tree problem , 1993, Networks.

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

[28]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/surrogate relaxation for generalized assignment problems , 1999, Eur. J. Oper. Res..

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

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

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

[32]  R. EsauL.,et al.  On teleprocessing system design , 1966 .

[33]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[34]  M. Ferguson,et al.  Topological Design of Multipoint Teleprocessing Networks , 1974, IEEE Trans. Commun..

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

[36]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

[37]  Michel Gendreau,et al.  Metaheuristics: Progress in Complex Systems Optimization , 2007 .

[38]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[39]  César Rego,et al.  RAMP: A New Metaheuristic Framework for Combinatorial Optimization , 2005 .