A DYNAMIC PROGRAMMING MODEL OF HIGHWAY NETWORK DEVELOPMENT

THIS PAPER PESENTS A DYNAMIC PROGRAMMING HIGHWAY LINK ADDITION MODEL AND HAS INDICATED WAYS IN WHICH ITS HEURISTIC MODIFICATION CAN PRODUCE COMPUTATIONAL FEASIBILITY. THE MODEL REPRESENTS AN IMPROVEMENT OVER THE FUNK AND TILLMAN FORMULATION IN THAT IT INCORPORATES THE INTERDEPENDENCY OF NETWORK CONFIGURATION AND TRAFFIC GENERATION DISTRIBUTION. IN EMPIRICAL EXAMPLES, THE DYNAMIC CONSTRUCTION SEQUENCE IS SHOWN TO PROVIDE IMPROVEMENTS OF 1.7 AND 1.0 PERCENT OVER THE MYOPIC. /RATAOC/

• Supplemental Notes:
  • Rpno 43, 29 PP, 6 FIG, 5 TAB, 7 REF, 2 APP
• Corporate Authors:

  University of Toronto

  Department of Geography, 100 St George Street
  Toronto, Ontario  Canada  M5S 3G3
• Authors:
  • Hodgson, M J
• Publication Date: 0

Subject/Index Terms

• TRT Terms: Dynamic programming; Feasibility analysis; Information processing; Mathematical models; Network analyzers; Traffic assignment; Trip generation
• Uncontrolled Terms: Models
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00227045
• Record Type: Publication
• Source Agency: Roads & Transportation Assoc /Canada
• Files: TRIS
• Created Date: Aug 3 1972 12:00AM