Fast paths in large-scale dynamic road networks

Details Fast paths in large-scale dynamic road networks Fast paths in large-scale dynamic road networks

2007-04-09

arxiv.org/abs/0704.1068v2

Computer Science

Networking and Internet Architecture

12 pages, 4 figures

Scientific paper

Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network.

Affiliated with

Also associated with

No associations

Rating

Fast paths in large-scale dynamic road networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast paths in large-scale dynamic road networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast paths in large-scale dynamic road networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-387199