OPTIMAL HIGHWAY STAGING BY DYNAMIC PROGRAMMING

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. /AUTHOR/

  • Availability:
  • Supplemental Notes:
    • Vol 96, No 1, PROC. PAPER 7080, PP 11-24
  • Authors:
    • de Neufville, R
    • MORI, Y
  • Publication Date: 1970-2

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00200383
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 13 1970 12:00AM