Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Clustering for the design of SONET rings in interoffice telecommunications
Management Science
Intensification and diversification with elite tabu search solutions for the linear ordering problem
Computers and Operations Research
Scatter search and path relinking
New ideas in optimization
Tabu Search
Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method
Journal of Heuristics
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
SONET/SDH ring assignment with capacity constraints
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Computers and Industrial Engineering
Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Variable neighborhood search and GRASP for three-layer hierarchical ring network design
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 0.00 |
This paper considers two problems that arise in the design of optical telecommunication networks when a ring-based topology is adopted, namely the SONET Ring Assignment Problem and the Intraring Synchronous Optical Network Design Problem. We show that these two network topology problems correspond to graph partitioning problems with capacity constraints: the first is a vertex partitioning problem, while the latter is an edge partitioning problem. We consider solution methods for both problems, based on metaheuristic algorithms. We first describe variable objective functions that depend on the transition from one solution to a neighboring one, then we apply several diversification and intensification techniques including Path Relinking, eXploring Tabu Search and Scatter Search. Finally we propose a diversification method based on the use of multiple neighborhoods. A set of extensive computational results is used to compare the behaviour of the proposed methods and objective functions.