Design techniques for SDH mesh-restorable networks

We studied the design of SDH mesh-restorable networks. We propose three different algorithms for solving the design problem: an integer linear programming (branch-and-cut-and-price) algorithm, a zoom-in approach which combines a genetic algorithm with deterministic optimisation routines and a GRASP based heuristic algorithm. We compare the numerical results we obtained by using these algorithms. For each of the algorithms, we study the cost of the designs which it produces and the time and memory requirement.