A STRATEGY FOR SOLVING STATIC MULTIPLE-OPTIMAL-PATH TRANSIT NETWORK PROBLEMS

Transit and private automobile trip making processes differ in their use of time schedules, walking paths, transfer stops, plus fares and safety issues. Shortest path algorithms cannot always be applied due these factors. The aim of this study is to develop an algorithm and strategy for transit providers to determine best alternatives for the user, and to demonstrate how geographic information systems can aid in development of transit advanced traveler information systems (TATIS) to address these needs. The authors present a short introduction on TATIS, commonly used algorithms in determining the shortest and multiple paths, and a unique strategy unlike the standard network algorithms. The major features of the proposed algorithm are: 1) handles multiple modes of transit; 2) provides paths that include walking distances from and to the transit path as well as between transfer points; and 3) offers multiple optimal paths to allow for user flexibility in choosing a path.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00721055
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: May 3 1996 12:00AM