Abstract
In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assignments (and, hence, add-drop multiplexer equipment requirements) is minimized, while satisfying the ring capacity and node cardinality constraints. This problem can be conceptualized as an edge-capacitated graph partitioning problem with node cardinality constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut algorithm along with preprocessing routines for optimally solving the problem. We also prescribe an effective heuristic procedure. Promising computational results are obtained using the proposed method.
| Original language | English |
|---|---|
| Pages (from-to) | 223-232 |
| Number of pages | 10 |
| Journal | Networks |
| Volume | 35 |
| Issue number | 3 |
| Publication status | Published - 2000 May 1 |
Fingerprint
Keywords
- Branch-and-cut
- SONET ring
- Survivable network design
- Telecommunications networks
- Valid inequality
ASJC Scopus subject areas
- Hardware and Architecture
Cite this
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. / Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong In.
In: Networks, Vol. 35, No. 3, 01.05.2000, p. 223-232.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
AU - Lee, Youngho
AU - Sherali, Hanif D.
AU - Han, Junghee
AU - Kim, Seong In
PY - 2000/5/1
Y1 - 2000/5/1
N2 - In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assignments (and, hence, add-drop multiplexer equipment requirements) is minimized, while satisfying the ring capacity and node cardinality constraints. This problem can be conceptualized as an edge-capacitated graph partitioning problem with node cardinality constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut algorithm along with preprocessing routines for optimally solving the problem. We also prescribe an effective heuristic procedure. Promising computational results are obtained using the proposed method.
AB - In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assignments (and, hence, add-drop multiplexer equipment requirements) is minimized, while satisfying the ring capacity and node cardinality constraints. This problem can be conceptualized as an edge-capacitated graph partitioning problem with node cardinality constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut algorithm along with preprocessing routines for optimally solving the problem. We also prescribe an effective heuristic procedure. Promising computational results are obtained using the proposed method.
KW - Branch-and-cut
KW - SONET ring
KW - Survivable network design
KW - Telecommunications networks
KW - Valid inequality
UR - http://www.scopus.com/inward/record.url?scp=0034178963&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034178963&partnerID=8YFLogxK
M3 - Article
VL - 35
SP - 223
EP - 232
JO - Networks
JF - Networks
SN - 0028-3045
IS - 3
ER -