An algorithm for capacity expansion of local access networks

An investigation to determine the minimum cost capacity expansion plan for the outside plant network to meet projected demand over a given planning horizon is presented. It is shown how the problem can be modeled as an integer programming problems; however, the size of the problem for a typical network precludes the use of a general-purpose integer programming code. A decomposition approach that takes advantage of the structure of the problem and allows the problem to be solved in a reasonable amount of time is proposed. The solution methods have been implemented and computational results are presented.<
>