Ring network design for metropolitan area

We consider the problem of designing ring networks for metropolitan area networks. Given a number of nodes representing locations that may be connected, the task is to construct a ring network by selecting a node subset and corresponding direct links. Any two nodes on the ring are enabled to communicate with each other so that the network provider gains a certain revenue. On the other hand, construction costs are incurred for the design of each direct link. The basic objective is to maximize the sum of all revenues minus the construction costs while building a ring network. We discuss certain relationships to other problems. Mathematical models are presented and used to obtain optimal solutions for small problem instances and upper bounds. We focus on the application of modern heuristic search concepts by means of a framework with generic components for heuristic search which enables the eecient adaptation to real world problems.

[1]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[5]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6]  Stefan Voss,et al.  Steiner-Probleme in Graphen , 1990 .

[7]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[8]  P.A. Morreale,et al.  Metropolitan-area networks , 1990, IEEE Spectrum.

[9]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

[10]  Kathryn A. Dowsland,et al.  Using Simulated Annealing for Efficient Allocation of Students to Practical Classes , 1993 .

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

[12]  Gilbert Laporte,et al.  Efficient heuristics for the design of ring networks , 1995, Telecommun. Syst..

[13]  Stefan Voß.  Dynamic tabu search strategies for the traveling purchaser problem , 1996, Ann. Oper. Res..

[14]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[15]  Ugo Mocci,et al.  Ring Network Design: an MCDM Approach , 1997 .

[16]  Cees Duin,et al.  The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs , 1999, Networks.

[17]  Thomas de Quincey.  [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.