Multiperiod capacity expansion of road networks: Formulation and algorithms

In this paper the multiperiod capacity expansion problem on a road network is formulated as a mathematical programming problem with a modified travel time function. Two algorithms are proposed for this network design problem with user optimal flows, based on an approach which alternatively solves the flow variable (inner) problem and the capacity variable (outer) problem. In the first algorithm, the outer problem is solved using a generalized network formulation and in the second algorithm it is solved using a heuristic followed by the revised simplex method, Computational experience with both the algorithms has been highlighted on a sample problem.