• DocumentCode
    480998
  • Title

    Genetic algorithms and iterated local search to solve the ring loading problem

  • Author

    Bernardino, Anabela M. ; Bernardino, Eugénia M. ; Sánchez-Pérez, Juan M. ; Gómez-Pulido, Juan A. ; Vega-Rodríguez, Miguel A.

  • Author_Institution
    Sch. of Technol. & Manage., Polytech. Inst. of Leiria, Leiria
  • Volume
    1
  • fYear
    2008
  • fDate
    10-12 Sept. 2008
  • Firstpage
    265
  • Lastpage
    268
  • Abstract
    The last few years have seen a significant growth in Synchronous Optical Network (SONET) deployments in telecommunication service providers. With growth of data traffic, network operators seek network-engineering tools to extract the maximum benefits out of the existing infrastructure. This has suggested a number of new optimization problems, most of them in the field of combinatorial optimization. We address here the Ring Loading Problem (RLP) - given a set of nodes connected along a bi-directional SONET ring, the objective is to minimize the maximum load on the edges (pair wise) of a ring. Our procedure includes some original features, including the application of Iterated Local Search and new methods of crossover and mutation when Genetic Algorithms are used.
  • Keywords
    genetic algorithms; optical fibre networks; optimisation; search problems; telecommunication services; bidirectional SONET ring; combinatorial optimization; data traffic; genetic algorithms; iterated local search; optimization problems; ring loading problem; synchronous optical network; telecommunication service providers; Clocks; Counting circuits; Evolution (biology); Genetic algorithms; Genetic mutations; SONET; Technology management; Telecommunication network management; Telecommunication services; Telecommunication traffic; Genetic Algorithms; Iterated Local Search; Optimization; Ring Loading Problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    ELMAR, 2008. 50th International Symposium
  • Conference_Location
    Zadar
  • ISSN
    1334-2630
  • Print_ISBN
    978-1-4244-3364-3
  • Type

    conf

  • Filename
    4747486