A branch-and-cut algorithm for solving an intraring synchronous optical network design problem

Youngho Lee, Hanif D. Sherali, Junghee Han, Seong In Kim

Research output: Contribution to journalArticle

23 Citations (Scopus)

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 languageEnglish
Pages (from-to)223-232
Number of pages10
JournalNetworks
Volume35
Issue number3
Publication statusPublished - 2000 May 1

Fingerprint

Integer programming
Fiber optic networks
Optical fibers

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 journalArticle

Lee, Y, Sherali, HD, Han, J & Kim, SI 2000, 'A branch-and-cut algorithm for solving an intraring synchronous optical network design problem', Networks, vol. 35, no. 3, pp. 223-232.
Lee, Youngho ; Sherali, Hanif D. ; Han, Junghee ; Kim, Seong In. / A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. In: Networks. 2000 ; Vol. 35, No. 3. pp. 223-232.
@article{0f4011df05c14d10b0ee7c15651593d4,
title = "A branch-and-cut algorithm for solving an intraring synchronous optical network design problem",
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.",
keywords = "Branch-and-cut, SONET ring, Survivable network design, Telecommunications networks, Valid inequality",
author = "Youngho Lee and Sherali, {Hanif D.} and Junghee Han and Kim, {Seong In}",
year = "2000",
month = "5",
day = "1",
language = "English",
volume = "35",
pages = "223--232",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "3",

}

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 -