A ring-mesh topology design problem for optical transport networks

Youngjin Kim, Youngho Lee, Junghee Han

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)183-202
Number of pages20
JournalJournal of Heuristics
Volume14
Issue number2
DOIs
Publication statusPublished - 2008 Apr 1

    Fingerprint

Keywords

  • Column generation
  • Integer programming
  • Optical transport network
  • Ring-mesh topology
  • Tabu search
  • Valid inequality

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Artificial Intelligence
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this