TRANSIT PATHFINDER ALGORITHM

THIS PAPER REPRESENTS ONE ELEMENT OF THE INITIAL PHASE IN THE DEVELOPMENT OF A PACKAGE OF COMPUTER PROGRAMS TO ASSIST IN MASS TRANSPORTATION PLANNING. THESE PROGRAMS PROVIDE A FLEXIBLE MEANS OF PREDICTING RIDERSHIP ON EACH LINE OF A PROPOSED MULTIMODE TRANSPORTATION SYSTEM WITHIN A GIVEN LAND-USE CONFIGURATION. A DESCRIPTION IS GIVEN OF AN IBM 7090 COMPUTER PROGRAM AND ITS ENABLING ALGORITHM WHICH FINDS MINIMUM TIME PATHS THROUGH A LARGE MULTI-MODAL TRANSPORTATION SYSTEM. THE PROGRAM'S CAPABILITIES AND ITS UNDERLYING ASSUMPTIONS ARE SUMMARIZED, AND ITS TERMS ARE DEFINED. STEP-BY-STEP DESCRIPTIONS AND FLOW CHARTS ARE PRESENTED OF THE WIDELY USED MOORE TREE-BUILDING ALGORITHM AND OF THE TRANSIT PATHFINDER, AN EXTENSION OF THE FORMER ALGORITHM ACCOMMODATING THE PECULIARITIES OF TRANSIT MINIMUM PATHS. /AUTHOR/

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 67-85
  • Monograph Title: Origin and Destination Characteristics
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00240968
  • Record Type: Publication
  • Files: TRIS, TRB
  • Created Date: Mar 18 1994 12:00AM