INTELLIGENT SHORTEST PATH ALGORITHMS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS

Recent interests in intelligent vehicle-highway systems have prompted a search for dynamic traffic assignment formulations with the capability to fully describe the dynamic between drivers and network traffic flows. Such dynamic traffic assignment formulations, when used on saturated urban highway networks, require computers to process large-scale traffic networks within relatively short periods of time. Therefore, efficient shortest path finding and updating algorithms will tremendously improve the overall dynamic traffic assignment computational throughput. This paper reviews recent developments in shortest path finding algorithms, including efficient k-shortest path algorithms. The computational efficiency of these improved algorithms is documented, and their applicability within the overall framework of intelligent vehicle-highway systems is described.

Language

  • English

Media Info

  • Features: References; Tables;
  • Pagination: 12p

Subject/Index Terms

Filing Info

  • Accession Number: 00625931
  • Record Type: Publication
  • ISBN: 0939204487
  • Files: TRIS
  • Created Date: Dec 17 1993 12:00AM