Sonet ring sizing with genetic algorithms

https://doi.org/10.1016/S0305-0548(95)00059-3Get rights and content

Abstract

We describe an optimization problem that arises in SONET ring sizing. We compare solutions obtained by the genetic algorithm to both optimal solutions obtained by the CPLEX mixed integer program solver and heuristic solutions generated by the algorithm that is incorporated in the SONET Toolkit—a decision support system for planning SONET networks.

References (12)

  • A. Frank et al.

    Algorithms for routing around a rectangle

    Discrete Appl. Maths

    (1992)
  • A. Frank

    Edge-disjoint paths in planar graphs

    J. Combinat. Theory, Series B

    (1985)
  • N. Karunanithi et al.

    A ring loading application of genetic algorithms

  • R.H. Cardwell et al.

    SONET: a ten-year perspective

    Bellcore Exchange

    (April 12–17 1994)
  • S. Cosares et al.

    An optimization problem related to balancing loads on SONET rings

    Telecommun. Syst.

    (1994)
  • A. Shulman et al.

    Multicommodity flows in ring networks

There are more references available in the full text version of this article.

Cited by (11)

View all citing articles on Scopus

A condensed version of this paper was presented at ACM Symposium on Applied Computing [1].

Nachimuthu Karunanithi is a Research Scientist at Bellcore in Morristown, NJ. He received his Ph.D. in Computer Science from Colorado State University. His research interests are personal communications systems, neural networks, genetic algorithms, and software reliability.

§

Tamra Carpenter is a Research Scientist at Bellcore in Morristown, NJ. She obtained her Ph.D. in Operations Research from Princeton University. Her research interests are in optimization and mathematical programming—particularly as they apply to telecommunications network design.

View full text