This paper is concerned with the design of a local access and transport area (LATA) network that arises in the context of providing a special access service by a local exchange facility. The problem includes locating suitable hub facilities having adequate multiplexing capacity, and routing the demand traffic from various clients (end offices) through their hubs, or alternatively, through a special point of presence node, in order to minimize total costs. These costs involve various traffic distribution and equipment component costs, where the latter typically exhibit nonlinear economies of scale. We develop a model for this problem and apply the reformulation-linearization technique (RLT) to construct various enhanced tightened versions of the proposed model. We also design a hybrid heuristic procedure that combines a limited run of an exact method with a Lagrangian dual/relaxation procedure. Extensive computational results are provided to study the relative tightness resulting from the various formulations and their effect on providing good quality feasible solutions.
Bibliographical noteFunding Information:
This material is based upon work supported by the National Science Foundation under Grant Number DMI-9521398 and DMI-9812047, and the Air Force Office of Scientific Research under Grant Number F49620-96-1-0274.
- Integer Programming
- Lagrangian relaxations
- Reformulation-linearization technique (RLT)
- Telecommunication networks
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management