NDLI: Shortest path calculation in large road networks

Content Provider	Springer Nature Link
Author	Ertl, Gerhard
Copyright Year	1998
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.Eines der grundlegenden Probleme in der Routenplanung ist die Berechnung des kürzesten Weges zwischen zwei Punkten in einem Straßennetz. Allgemeine kürzeste Wege Algorithmen, die einen großen Teil des gesamten Graphen untersuchen, sind in großen Netzwerken sehr langsam. Da sich Straßennetze nicht sehr oft ändern, kann in einem Vorbereitungsschritt eine Hilfsdatenstruktur berechnet werden. Mit Hilfe dieser Datenstruktur können die kürzesten Wege wesentlich schneller aufgefunden werden, als mit herkömmlichen Algorithmen. Der Speicherplatz der Hilfsdatenstruktur wächst linear mit der Anzahl der Kanten im Netzwerk.
Starting Page	15
Ending Page	20
Page Count	6
File Format	PDF
ISSN	01716468
Journal	OR Spectrum
Volume Number	20
Issue Number	1
e-ISSN	14366304
Language	English
Publisher	Springer-Verlag
Publisher Date	1998-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Kürzeste Wege Routenplanung Calculus of Variations and Optimal Control Optimization Business/Management Science Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research Business, Management and Accounting

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

Distribution function of the shortest path in networks of queues

A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems

K-Shortest routing of trains on shunting yards

Solving elementary shortest-path problems as mixed-integer programs

A multi-objective shortest path problem

Palletmanager/cargomanager

Maynard Assembly Manager

Collaborative planning in transportation

Outstanding reviewer award 2016

Shortest path calculation in large road networks

Similar Documents

Distribution function of the shortest path in networks of queues

A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems

K-Shortest routing of trains on shunting yards

Solving elementary shortest-path problems as mixed-integer programs

A multi-objective shortest path problem

Palletmanager/cargomanager

Maynard Assembly Manager

Collaborative planning in transportation

Outstanding reviewer award 2016

Shortest path calculation in large road networks