Application of optimal subset selection to problems of design and scheduling in urban transportation networks

The paper describes some possibilities for modifying the optimal network algorithm developed by Boyce, Farhi and Weischedel in a way that makes it applicable to some practical problems of network planning. The modifications, which have been tested with respect to their effect on the efficiency of the algorithm, include the introduction of asymmetrical demand structures, the integration of an existing network, the lexico-minimization of a dynamic objective function, and the consideration of constraints related to interdependencies between candidate links. Two small network problems and one medium-sized problem (61 nodes, 104 links, 16 candidates) have been computed; the results support the hypothesis that the algorithm may be applied to produce approximate solutions to problems of practical dimensions within a reasonable range of time.