A combined linear and dynamic programming model for interdependent road investment planning.

Author(s)
Bergendahl, G.
Year
Abstract

The problem to be considered is to find a method for solving interdependent road investment problems. This is done by formulating a dynamic network flow model, where investments can only be made at discrete dates. This model is solved in two phases, in the first one by linear programming and in the second one by dynamic programming.

Request publication

6 + 14 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
A 5235 T IRRD 46828
Source

Transportation Research, Vol. 3 (1969), No. 2 (July), p. 211-28

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.