Hierarchical Two Level Location Problems

A telecommunication network is usually composed of a backbone network and of local access networks. The backbone network enables the transfer of large volumes of information between its nodes whereas each local access network connects a group of terminals to an access node of the backbone network. Communication channels between terminals are established through their access nodes via the backbone network. The design of a telecommunication network is so complex that the process is usually split into phases where each phase handles a subproblem and makes decisions that are fixed and used as input to the next phases (Gavish, 1991 and 1992). A standard approach involves the following phases (Minoux, 1989; Gavish, 1991): ■ the choice of locations for backbone nodes, ■ the assignment of terminals to backbone nodes, ■ the design of local access networks, ■ the design of the backbone network, ■ the evaluation of the network in terms of performance and reliability.

[1]  P. Chardaire,et al.  Solving the dynamic facility location problem , 1996 .

[2]  Luís Gouveia,et al.  Using generalized capacitated trees for designing the topology of local access networks , 1997, Telecommun. Syst..

[3]  Prakash Mirchandani,et al.  The Multi-Tier Tree Problem , 1996, INFORMS J. Comput..

[4]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[5]  Pierre Chardaire,et al.  Using Simulated annealing to solve concentrator location problems in telecommunication networks , 1993 .

[6]  Lalit R. Bahl,et al.  Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals , 1978, IEEE Transactions on Computers.

[7]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .

[8]  José Pinto Paixão,et al.  Dynamic programming based heuristics for the topological design of local access networks , 1991, Ann. Oper. Res..

[9]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[10]  Søren Kruse Jacobsen,et al.  Heuristics for the capacitated plant location model , 1983 .

[11]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

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

[13]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[14]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[15]  B. Shetty.  Approximate solutions to large scale capacitated facility location problems , 1990 .

[16]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[17]  K. Jörnsten,et al.  Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem , 1991 .

[18]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[19]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[20]  G. Michael Schneider,et al.  An Algorithm for the Design of Multilevel Concentrator Networks , 1982, Comput. Networks.

[21]  P. McGregor,et al.  Network Design: An Algorithm for the Access Facility Location Problem , 1977, IEEE Trans. Commun..

[22]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[23]  J. Beasley.  An algorithm for solving large capacitated warehouse location problems , 1988 .

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

[25]  Nicos Christofides,et al.  Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

[26]  Laurence A. Wolsey,et al.  Capacitated Facility Location: Valid Inequalities and Facets , 1995, Math. Oper. Res..

[27]  Aaron Kershenbaum,et al.  Computing capacitated minimal spanning trees efficiently , 1974, Networks.

[28]  N. Z. Shor.  The rate of convergence of the generalized gradient descent method , 1968 .

[29]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[30]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[31]  G. Cornuéjols,et al.  A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[32]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

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

[34]  Alan M. Frieze,et al.  Probabilistic Analysis of a Relaxation for the k-Median Problem , 1986, Math. Oper. Res..

[35]  Hasan Pirkul,et al.  Hierarchical concentrator location problem , 1992, Comput. Commun..

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

[37]  Pierre Chardaire,et al.  Grade of Service and Optimization of Distributed Packet-Switched Networks , 1986, Comput. Networks.

[38]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[39]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[40]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[41]  T. Magnanti,et al.  A Dual-Based Algorithm for Multi-Level Network Design , 1994 .

[42]  Guoliang Xue.  Linear time algorithms for computing the most reliable source on an unreliable tree network , 1997 .

[43]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[44]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[45]  Thomas L. Magnanti,et al.  Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..

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