DYNAMIC PROGRAMMING OF HIGHWAY SAFETY PROJECTS

THE SELECTION OF HIGHWAY SAFETY IMPROVEMENT PROJECTS IS INDEED A COMPLEX TASK. USUALLY, NUMEROUS HAZARDOUS LOCATIONS ARE CANDIDATES FOR IMPROVEMENT, WITH SEVERAL ACCEPTABLE PROJECTS AVAILABLE AT EACH LOCATION. FUNDS ARE SELDOM SUFFICIENT, HOWEVER, TO IMPLEMENT PROJECTS AT EACH HAZARDOUS LOCATION. THEREFORE, IT IS NECESSARY THAT THE PROJECT SELECTION PROCESS FUNCTION UNDER THE RESTRICTION OF A LIMITED BUDGET. THE CLASSICAL ECONOMIC ANALYSIS TECHNIQUES SUCH AS RATE OF RETURN AND BENEFIT COST CANNOT BE RELIED UPON TO DETERMINE THE OPTIMUM PROJECT COMBINATION WITH THIS RESTRICTION. THE TECHNIQUE OF DYNAMIC PROGRAMMING IS IDEAL FOR APPLICATION TO THIS PROBLEM. AN EXAMPLE CONSISTING OF THREE HAZARDOUS LOCATIONS ILLUSTRATES THE PITFALLS ASSOCIATED WITH PREVIOUSLY RECOMMENDED PROJECT SELECTION PROCESSES AND DEMONSTRATES THE MANNER IN WHICH DYNAMIC PROGRAMMING LEADS DIRECTLY TO THE OPTIMUM SAFETY PROJECT COMBINATION. /AUTHOR/

  • Availability:
  • Supplemental Notes:
    • Vol 97, No TE4, PROC PAPER 8534, PP 667-679, 2 FIG, 10 TAB,
  • Corporate Authors:

    American Society of Civil Engineers

    345 East 47th Street
    New York, NY  USA  10017-2398
  • Authors:
    • Johnson, M M
    • Dare, C E
    • Skinner, H B
  • Publication Date: 1971-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00221530
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Feb 24 1972 12:00AM