Optimal Network Capacity Planning: A Shortest-Path Scheme

The sequential decision problem considered in this paper consists of finding an optimal policy for increasing the capacity of a multi-terminal network with requirements increasing over a planning period and arcs subject to failure. This problem is formulated as a shortest-route problem in a very large network and solved by Dijkstra's algorithm. Computational experience is also presented.