NDLI: Time-Dependent SHARC-Routing

Content Provider	Springer Nature Link
Author	Delling, Daniel
Copyright Year	2009
Abstract	In recent years, many speed-up techniques for Dijkstra’s algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks which, unfortunately, appear quite frequently in reality: Roads are predictably congested by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed.In this work, we present an efficient time-dependent route planning algorithm. It is based on our recently introduced SHARC algorithm, which we adapt by augmenting its basic ingredients such that correctness can still be guaranteed in a time-dependent scenario. As a result, we are able to efficiently compute exact shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways. It should be noted that time-dependent SHARC was the first efficient algorithm for time-dependent route planning.
Starting Page	60
Ending Page	94
Page Count	35
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	60
Issue Number	1
e-ISSN	14320541
Language	English
Publisher	Springer-Verlag
Publisher Date	2009-07-09
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Algorithm engineering Graph algorithms Time-dependent shortest paths Timetable information Data Structures, Cryptology and Information Theory Algorithms Computer Systems Organization and Communication Networks Mathematics of Computing Theory of Computation Algorithm Analysis and Problem Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Shortest Paths in Time-Dependent FIFO Networks

On the Complexity of Time-Dependent Shortest Paths

On Dynamic Shortest Paths Problems

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time

Distance Oracles for Time-Dependent Networks

On Finding Min-Min Disjoint Paths

Finding Shortest Paths Between Graph Colourings

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks

Time-Dependent SHARC-Routing

Similar Documents

Shortest Paths in Time-Dependent FIFO Networks

On the Complexity of Time-Dependent Shortest Paths

On Dynamic Shortest Paths Problems

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time

Distance Oracles for Time-Dependent Networks

On Finding Min-Min Disjoint Paths

Finding Shortest Paths Between Graph Colourings

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks

Time-Dependent SHARC-Routing