A tabu search algorithm for self-healing ring network design.

DOI10.1016/S0377-2217(02)00826-3zbMath1053.90020MaRDI QIDQ1410612

Christelle Wynants, Patrick Soriano, Bernard Fortz

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Tabu searchNetwork designTelecommunicationsSurvivabilitySelf-healing rings

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Search theory (90B40)

Related Items (5)

Hierarchical survivable network design problems ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Optimization in telecommunication networks ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ Approximation algorithms for the design of SDH/SONET networks

Uses Software

• Tabu search
• SONET

Cites Work

• Unnamed Item
• Design of stacked self-healing rings using a genetic algorithm
• Topological design of ring networks
• SONET/SDH ring assignment with capacity constraints
• Covering a graph with cycles.
• Designing tributary networks with multiple ring families.
• An optimal strategy for the Constrained Cycle Cover Problem
• Optimization based algorithms for finding minimal cost ring covers in survivable networks
• Future paths for integer programming and links to artificial intelligence
• Diversification strategies in tabu search algorithms for the maximum clique problem
• Exact solution of the SONET ring loading problem
• A user's guide to tabu search
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• An algorithm for designing rings for survivable fiber networks
• Multi-Terminal Network Flows
• Fondements et applications des méthodes de recherche avec tabous
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• Clustering for the Design of SONET Rings in Interoffice Telecommunications

This page was built for publication: A tabu search algorithm for self-healing ring network design.