Abstract
One of the basic problems in transportation planning systems is the calculation of the fastest route between two points in a road network. General shortest path algorithms, which examine a large part of the whole graph for each shortest path, are very slow if the road network is large. Since the road network does not change very often it is possible to calculate auxiliary information in a preprocessing step. I will present a preprocessing algorithm which requires linear storage. It is substantially faster than the general algorithms without preprocessing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
