On stacking bi-directional self-healing-rings on a conduit ring

Authors:
Byung-Suk Min;Dong-Wan Tcha
Affiliations:
Graduate School of Management, KAIST (Korea Advanced Institute of Science and Technology), 207-43 Cheongryangri-Dong, Dongdaemun-Gu, Seoul 130-012, South Korea;Graduate School of Management, KAIST (Korea Advanced Institute of Science and Technology), 207-43 Cheongryangri-Dong, Dongdaemun-Gu, Seoul 130-012, South Korea
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 10
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
The Ring Loading Problem

SIAM Journal on Discrete Mathematics
Designing tributary networks with multiple ring families

Computers and Operations Research
Fiber Network Service Survivability

Fiber Network Service Survivability
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting

SIAM Journal on Discrete Mathematics
Design of Stacked Self-Healing Rings Using a Genetic Algorithm

Journal of Heuristics
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms

Operations Research
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting

INFORMS Journal on Computing
Topological network design for SONET ring architecture

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Application, design, and evolution of WDM in GTS's pan-European transport network

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a network design problem of stacking multiple bi-directional self-healing-rings (BSHRs) on a given physical conduit ring in order to meet given demand requirements. The objective is then to find a cost-minimizing solution which not only specifies how many and what kinds of BSHR rings to install, but also indicates how to split the demand requirements among the installed BSHRs. The problem has been formulated as an IP model and then reformulated to a set-partitioning model via the column generation approach. An iterative solution method of alternating between two phases of generating and fixing columns was developed and tested with three different demand patterns. Computational experience gained from a total of more than 100 test runs for each demand pattern strongly supports the real-world applicability of the proposed model and the solution method.