Optimal Highway Staging by Dynamic Programming

by Richard de Neufville, (A.M.ASCE), Asst. Prof. of Civ. Engrg.; M.I.T. Cambridge, MA,
Yasuo Mori, Civ. Engr.; Japan Highway Public Corp., Tokyo, Japan,

Serial Information: Transportation Engineering Journal of ASCE, 1970, Vol. 96, Issue 1, Pg. 11-24

Document Type: Journal Paper


A practical procedure for defining an optimal sequence of highway improvements over time, for which computer programs are available, is described. An efficient procedure has been developed by modifying the techniques of dynamic programming, a method which will guarantee the definition of an optimal schedule of independent projects. Specifically, computational efficiency is achieved by use of a variable increment, alternative-oriented approach to dynamic programming, similar to implicit enumeration. Examples demonstrate how dynamic programming can determine the most effective combination of projects when a straight benefit cost analysis cannot.

Subject Headings: Computer programming | Highways and roads | Computer software | Terminology and definition | Scheduling | Benefit cost ratios | Construction costs | Dynamic analysis

Services: Buy this book/Buy this article


Return to search