By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Anabela M. Bernardino ; School of Technology and Management, Polytechnic Institute of Leiria, Portugal ; Eugenia M. Bernardino ; Juan M. Sanchez-Perez ; Juan A. Gomez-Pulido
more authors

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.

Published in:

ELMAR, 2008. 50th International Symposium  (Volume:1 )

Date of Conference:

10-12 Sept. 2008