ILP-based heuristic method for the multi-period survivable network augmentation problem

Abstract

This paper studies the optimization of a multi-period survivable network augmentation (MPSNA) problem. An integer linear programming (ILP) model is formulated. Because the MPSNA problem is very time-consuming to solve even for a very small network, a four-stage ILP-based heuristic approach is developed. Simulations on six test case networks of various sizes are carried out. The experimental results show that our approach is effective at solving the MPSNA problem.