A ring-mesh topology design problem for optical transport networks
- Authors
- Kim, Youngjin; Lee, Youngho; Han, Junghee
- Issue Date
- 4월-2008
- Publisher
- SPRINGER
- Keywords
- optical transport network; ring-mesh topology; integer programming; tabu search; column generation; valid inequality
- Citation
- JOURNAL OF HEURISTICS, v.14, no.2, pp.183 - 202
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF HEURISTICS
- Volume
- 14
- Number
- 2
- Start Page
- 183
- End Page
- 202
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/123797
- DOI
- 10.1007/s10732-007-9034-2
- ISSN
- 1381-1231
- Abstract
- This paper deals with a ring-mesh network design problem arising from the deployment of an optical transport network. The problem seeks to find an optimal clustering of traffic demands in the network such that the total cost of optical add-drop multiplexer (OADM) and optical cross-connect (OXC) is minimized, while satisfying the OADM ring capacity constraint, the node cardinality constraint, and the OXC capacity constraint. We formulate the problem as an integer programming model and propose several alternative modeling techniques designed to improve the mathematical representation of the problem. We then develop various classes of valid inequalities to tighten the mathematical formulation of the problem and describe an algorithmic approach that coordinates tailored routines with a commercial solver CPLEX. We also propose an effective tabu search procedure for finding a good feasible solution as well as for providing a good incumbent solution for the column generation based heuristic procedure that enhances the solvability of the problem. Computational results exhibit the viability of the proposed method.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.