Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 94-108 |
| Number of pages | 15 |
| Journal | European Journal of Operational Research |
| Volume | 127 |
| Issue number | 1 |
| Publication status | Published - 2000 Nov 16 |
| Externally published | Yes |
Fingerprint
Keywords
- Integer Programming
- Lagrangian relaxations
- Reformulation-linearization technique (RLT)
- Telecommunication networks
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Applied Mathematics
- Modelling and Simulation
- Transportation
Cite this
New modeling approaches for the design of local access transport area networks. / Sherali, Hanif D.; Lee, Youngho; Park, Taehyung.
In: European Journal of Operational Research, Vol. 127, No. 1, 16.11.2000, p. 94-108.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - New modeling approaches for the design of local access transport area networks
AU - Sherali, Hanif D.
AU - Lee, Youngho
AU - Park, Taehyung
PY - 2000/11/16
Y1 - 2000/11/16
N2 - 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.
AB - 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.
KW - Integer Programming
KW - Lagrangian relaxations
KW - Reformulation-linearization technique (RLT)
KW - Telecommunication networks
UR - http://www.scopus.com/inward/record.url?scp=0347109592&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0347109592&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0347109592
VL - 127
SP - 94
EP - 108
JO - European Journal of Operational Research
JF - European Journal of Operational Research
SN - 0377-2217
IS - 1
ER -