A Route Navigation System with a New Revised Shortest Path Routing Algorithm and its Performance Evaluation

The paper presents a route navigation system with a new revised shortest path routing algorithm for solving road traffic problems. The system can avoid selecting no left (right) turns, one-way roads, and congested roads when it determines the shortest path form source to destination. Also, the new revised routing algorithm is compared numerically with existing algorithms such as the Dijkstra algorithm and the A* algorithm. This paper chooses a road network that contains 4000 nodes that have 200 no left turn situations and finds in particular that the road traffic problem of a 4000-node traffic network can be solved within only 0.651 seconds on average. The prototype system was built and some extra functions were added so that its benefits not only offer the shortest path but also provide information and security services for drivers.

Language

  • English

Media Info

  • Media Type: Print
  • Features: Figures; References;
  • Pagination: pp 733-743
  • Monograph Title: Urban Transport XI: Urban Transport and the Environment in the 21st Century

Subject/Index Terms

Filing Info

  • Accession Number: 01001154
  • Record Type: Publication
  • ISBN: 184564008X
  • Files: TRIS
  • Created Date: Jun 23 2005 12:40PM