The Restoration Problem in a Partially Equipped SDH Network

  • Christelle Wynants
Chapter
Part of the Combinatorial Optimization book series (COOP, volume 8)

Abstract

In this chapter we study a practical application of the network synthesis problem, that is, the restoration problem in a partially equipped SDH telecommunication network. This application was suggested by a telecommunication operator. We propose an arc-path formulation and we develop a procedure for finding good approximate solutions for real-size instances.

Keywords

Tabu Search Node Failure Greedy Heuristic Tabu Search Algorithm Spare Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Christelle Wynants
    • 1
  1. 1.Service de Mathématiques de la Gestion, Institut de Statistique et de Recherche OpérationnelleUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations