A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. Such a system has to process a large number of on-line queries in real time. ...
In this study, various optimality-preserving speed-up techniques for Dijkstra's algorithm were analyzed empirically. ...
infinite number of customer queries on-line. ...
doi:10.1007/3-540-48318-7_11
fatcat:7nlgupiygvdkni3fp7tsddyoeq
Dijkstra's algorithm on-line
2000
ACM Journal of Experimental Algorithmics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this study, various speed-up techniques for Dijkstra's algorithm were analysed empirically. ...
We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. ...
In fact, we are not aware of any publication especially about algorithms for wide-area railroad traffic information systems. Some scientific work has been done on local public transport. ...
doi:10.1145/351827.384254
fatcat:vh7rqj7fyvgflg5bgkycomowbi
Using Multi-level Graphs for Timetable Information in Railway Systems
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For one specific application scenario from the field of timetable information in public transport, we perform a detailed analysis and experimental evaluation of shortest path computations based on multi-level ...
Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. ...
These are the only publications known to us that investigate distance-preserving speed-up techniques of Dijkstra's algorithm. ...
doi:10.1007/3-540-45643-0_4
fatcat:4lan76llbfhjdb5nm2rlbsog2y
Route Planning and Map Inference with Global Positioning Traces
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
and refined graph traversal algorithms like Dijkstras' single-source shortest path algorithm or A*. ...
For high-precision map inference especially in car navigation, algorithms for road segmentation, map matching and lane clustering are presented. ...
In the scenario of a central information server in the realm of public railroad transport on wide area networks a system has to process a large number of on-line queries for optimal travel connections ...
doi:10.1007/3-540-36477-3_10
fatcat:72qjpkymbvezvcngkv7kbo227q
A software engineering perspective on algorithmics
2001
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
These goals are illustrated, motivated, and justified by an extensive requirements analysis for a particular algorithm from a particular algorithmic domain: Dijkstra's algorithm for shortest paths in networks ...
The analysis will include a discussion of the limits of the case study and the scope of the goals. ...
We refer to Schulz et al. [1999] for a concrete experimental case study on algorithms for information systems in the public railroad transport in Germany. (1) The first, most basic speed-up technique ...
doi:10.1145/375360.375367
fatcat:iwtp4bwlb5covlh4yfon3mymem
Sliver Removal in Object-Based Change Detection from VHR Satellite Images
2016
Photogrammetric Engineering and Remote Sensing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The direction of one line segment is defined by the direction of the vector which connects its two end points (see ). ...
a case study. ...
In the case of VHR images, pixels are significantly smaller than real objects (buildings, tree crowns, roads, etc.) and data processing may evolve from a basic pixel-to-pixel approach toward a new object-to-object ...
doi:10.14358/pers.82.2.161
fatcat:b2n5myfsp5cariggcod6iiuzau
Engineering shortest paths and layout algorithms for large graphs
2005
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In einer ersten Studie betrachten wir den Spezialfall eines Auskunftssystems für Bus und Bahn. ...
Eine experimentelle Studie geht der Frage nach, welche geometrischen Partitionierungen für diese Technik am besten geeignet sind. ...
algorithm (left) and Dijkstra's algorithm with pruning using bounding boxes (right).the on-line queries fast. ...
doi:10.5445/ir/1000003385
fatcat:gcoapgcfhzfytgp2g7ntdvg7di
Page 2490 of Mathematical Reviews Vol. , Issue Subject Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
empirical case study from public railroad transport. ...
(English summary)
— see also Huang, Ding-wei
Schreckenberg, Michael see Schadschneider, Andreas and Huang, Ding-wei
Schulz, Frank (with Wagner, Dorothea; Weihe, Karsten) Dijkstra’s algorithm on-line: an ...
Page 1767 of Mathematical Reviews Vol. , Issue Author Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(see 2002d:90004) 90B35 (90C15)
Schulz, Frank (with Wagner, Dorothea; Weihe, Karsten) Dijkstra’s algorithm on-line: an empirical case study from public railroad transport. ...
An improved randomized al- gorithm for 3-SAT. (English summary) New developments of the theory of computa- tion and algorithms (Japanese) (Kyoto, 2001). ...
Dispersion
[chapter]
2008
Business Site Selection, Location Analysis and GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
, and Dijkstra's shortest path algorithm, to name a few. ...
This chapter will focus on line-based single-facility location, and area-based facilities will be addressed in Chapter 8. ...
Weiszfeld algorithm Iterative solution technique for solving the Weber problem (single-facility Euclidean distance location problem). ...
doi:10.1002/9780470432761.ch10
fatcat:e7r5a7g5ybhpzbgx6xjav2wrzq
Timetable information and shortest paths
2005
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
, which is especially important in an on-line setting. ...
Figure 5 . 5 12: Speedup relative to Dijkstra's algorithm in terms of visited nodes for real-world graphs (in this order: street graphs in red and public transport graphs in blue)
Figure 6 . 2 : 62 Sample ...
Timetable Information We have thoroughly investigated models and algorithms for the core of an timetable information system for public transportation. ...
doi:10.5445/ir/1000002042
fatcat:tfmmar2xbfckhmdwp2cpobmn74
OASIcs, Volume 33, ATMOS'13, Complete Volume
[article]
2013
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We want to thank an anonymous reviewer for his/her extensive feedback. ...
, Roma Servizi per la Mobilità, and in particular Luca Allulli, Carlo Gentile, Damiano Morosi, and Fabio Schiavo, for their kind assistance with the GPS data used to track the transit vehicles in the transport ...
i are stops on line l i , and s i−1 is served before s i on line l i . ...
doi:10.4230/oasics.atmos.2013
fatcat:mj7bxl5go5aozmeldhgwrvhega
Personalized route finding in multimodal transportation networks
[article]
2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Krygsman (2004) described results of an empirical study on activity and travel choice(s) in multimodal public transportation Systems. ...
On-line journey planners can help travellers to plan a journey from A to B (ideally door-to-door), combining different modes of available transportation, their schedules and even fares. ...
Summary This thesis is the result of the work package modelling multimodal transport system (WP 3) of the EU FP7 project i-TOUR: intelligent Transport system for Optimized URban trips. ...
doi:10.6100/ir850710
fatcat:7gxdqsa5nnelnlf774rs5etqsy
Identifying attributes relevant for route choice in public transport
2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This thesis investigates the attributes of stations in the public transport system that are relevant for a human being when making routing decisions. ...
Finally the importance of each attribute is rated by the use of an online questionnaire. ...
Walking Distance The distance from my starting point to the public transport station.
Walking Distances when changing Lines Length of the walk when I change from one line to another. ...
doi:10.34726/hss.2014.24281
fatcat:asa7okzfjrakjo74oqpbrwztqu
Calibration of public transit routing for multi-agent simulation
[article]
2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Public transport is a widely used transport mode around the world. ...
Transport engineering has provided guidelines and techniques that help transit agencies in tasks of modeling, planning, administration, and evaluation of public transport systems. ...
Public transport is in many of those cases the most convenient and affordable transportation mode. ...
doi:10.14279/depositonce-4061
fatcat:h5tgkq3npjaaxi7v4a76mrboea
« Previous
Showing results 1 — 15 out of 22 results