Exact solution of the SONET Ring Loading Problem

Authors:
Mauro Dell'Amico;Martine Labbé;Francesco Maffioli
Affiliations:
Dipartimento di Scienze e Metodi Dell'Ingegneria, Universití di Modena e Reggio Emilia, Viale Allegri, 15, 42100 Reggio Emilia, Italy;Institut de Statistique et Recherche Opérationnelle and Service de Mathématiques de la Gestion, Université Libre de Bruxelles, CP 210/01, Boulevard de Triomphe, B-1050 Bruxelles, Be ...;Dipartimento di Elettronica e Informazione, Politecnico di Milano, P.zza L. da Vinci 32, 20133 Milano, Italy
Venue:
Operations Research Letters
Year:
1999

Citing 3
Cited 8

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Algorithms for routing around a rectangle

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
The Ring Loading Problem

SIAM Journal on Discrete Mathematics

SONET/SDH ring assignment with capacity constraints

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Linear time algorithms for the ring loading problem with demand splitting

Journal of Algorithms
A discrete differential evolution algorithm for solving the weighted ring arc loading problem

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Routing algorithms in resilient packet rings

SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
Efficient load balancing using the bees algorithm

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A hybrid ant colony optimization algorithm for solving the ring arc-loading problem

SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Efficient load balancing for a resilient packet ring using artificial bee colony

EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
On the ring loading problem with demand splitting

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of planning the capacity of the local rings in synchronous optical networks (SONET). We present efficient lower and upper bound procedures and a branch and bound algorithm which is able to find the exact solution of large instances, employing short computing times.