A K-Shortest Path Algorithm for Transit Network Based on Partial Overlap

The paper discusses the seamlessly integrating multiple modes of transit in geographic information systems (GIS) and it calculates the k-shortest paths in the network between origin and destination with a new topological structure and a new algorithm based on partial overlap. A node projecting method and two dummy links have been used to connect different networks. An efficient and loopless k-shortest path algorithm based on this topological structure is introduced. The result paths can be offered visually through GIS. Users can get very precise and efficient travel information. The partial overlap indicator introduced in this study could also be used to evaluate a park and ride system and scatter the park and ride sites to alleviate the congestion.

• Corporate Authors:

  World Conference on Transport Research Society

  Secretariat, 14 Avenue Berthelot
  69363 Lyon cedex 07,   France 
• Authors:
  • Sun, Zhuo
  • Kato, Hirokazu
  • Hayashi, Yoshitsugu
• Conference:
  • 11th World Conference on Transport Research
  • Location: Berkeley CA, United States
  • Date: 2007-6-24 to 2007-6-28
• Publication Date: 2007

Language

• English

Media Info

• Media Type: CD-ROM
• Features: Figures; References;
• Pagination: 9p
• Monograph Title: 11th World Conference on Transport Research

Subject/Index Terms

• TRT Terms: Geographic information systems; Network nodes; Origin and destination; Park and ride; Public transit; Shortest path algorithms; Traffic congestion; Transit operating agencies
• Subject Areas: Data and Information Technology; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01117278
• Record Type: Publication
• Files: TRIS
• Created Date: Dec 30 2008 12:31PM