The Restoration Problem in a Partially Equipped SDH Network
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.
KeywordsTabu Search Node Failure Greedy Heuristic Tabu Search Algorithm Spare Capacity
Unable to display preview. Download preview PDF.