Towards a Flexible and Scalable Fleet Management Service
Published 5 November 2013
Alexandros Efentakis, Sotiris Brakatsoulas, N. Grivas, Giorgos Lamprianidis, Kostas Patroumpas, Dieter Pfoser
Citations22
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper showcases various research results wrapped in a single extensible fleet management platform and presents cost-effective solutions for adapting state-of-the-art research around map-matching and live traffic assessment in the context of fleet management applications.
Abstract
GPS positioning devices are becoming a commodity sensor platform with the emergence and popularity of smartphones. This abundance of GPS trajectories has fueled significant research around map-matching and related applications such as traffic assessment and prediction. Unfortunately, this research has only been used in costly and complex fleet management solutions. Our latest research endeavor addresses this issue by presenting cost-effective solutions for adapting state-of-the-art research around map-matching and live traffic assessment in the context of fleet management applications. This paper showcases various research results wrapped in a single extensible fleet management platform.
Keywords
Computer ScienceEngineering
Map-matching for low-sampling-rate GPS trajectories
777 Citations2009Yin Lou, Chengyang Zhang +4 more
The results show that the ST-matching algorithm significantly outperform incremental algorithm in terms of matching accuracy for low-sampling trajectories and when compared with AFD-based global algorithm, ST-Matching also improves accuracy as well as running time.
Symposium on Discrete AlgorithmsComputing the shortest path: A search meets graph theory
725 Citations2005Andrew V. Goldberg, Chris Harrelson
Experimental results show that the most efficient of the new shortest path algorithms outperforms previous algorithms, in particular A* search with Euclidean bounds, by a wide margin on road networks and on some synthetic problem families.
Lecture notes in computer scienceContraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
689 Citations2008Robert Geisberger, Peter Sanders +2 more
CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios, and a hierarchical query algorithm using bidirectional shortest-path search is obtained.
On map-matching vehicle tracking data
505 Citations2005Sotiris Brakatsoulas, Dieter Pfoser +2 more
This work presents three algorithms that consider especially the trajectory nature of the data rather than simply the current position as in the typical map-matching case, and proposes an incremental algorithm that matches consecutive portions of the trajectory to the road network.
Real-time routing with OpenStreetMap data
443 Citations2011Dennis Luxen, Christian Vetter
This work demonstrates both a server and a hand-held device based implementation working with OpenStreetMap data that provide real-time and exact shortest path computation on continental sized networks with millions of street segments.
Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms
132 Citations2006Carola Wenk, Rocio Zozaya Salas +1 more
Output-sensitiveness paired with error-aware pruning makes adaptive clipping the first map- matching algorithm that provably solves a well-defined map-matching task.
Lecture notes in computer scienceLandmark-Based Routing in Dynamic Graphs
109 Citations2007Daniel Delling, Dorothea Wagner
It turns out that by increasing the efficiency of ALT, one is able to perform fast (down to 20 ms on the Western European network) random queries in a dynamic scenario without updating the preprocessing as long as the changes in the network are moderate.
Computing isochrones in multi-modal, schedule-based transport networks
33 Citations2008Veronika Bauer, Johann Gamper +4 more
A solution to compute isochrones in multi-modal, schedule-based transport networks and is implemented in Java on top of the Oracle Spatial Network Model and is deployed at the Municipality of Bolzano-Bozen as a planning instrument.
Optimizing Landmark-Based Routing and Preprocessing
24 Citations2013Alexandros Efentakis, Dieter Pfoser
This work significantly improves the classic ALT (A* + Landmarks + Triangle equality) algorithm by carefully optimizing both preprocessing and query phases, effectively minimize preprocessing time to a few seconds, making the ALT algorithm also suitable for dynamic scenarios, i.e., road networks with changing edge weights due to traffic updates.
Isochrones, traffic and DEMOgraphics
21 Citations2013Alexandros Efentakis, N. Grivas +3 more
This work utilizes live-traffic assessment results produced by Floating Car Data and their application to such crucial geomarketing test cases to provide efficient catchment area and reachability calculations.
Lecture notes in computer scienceDetermining Objects within Isochrones in Spatial Network Databases
20 Citations2010Šarūnas Marciuška, Johann Gamper
This paper presents two algorithms for determining all objects that are within an isochrone, and in an empirical evaluation using real-world data they are compared with a precise yet expensive baseline algorithm.
Efficient data management in support of shortest-path computation
17 Citations2011Alexandros Efentakis, Dieter Pfoser +1 more
This work proposes a data management approach for efficient shortest path computation that exploits road network hierarchies and allow us to minimize the portion of the network that is kept in main memory.
Crowdsourcing computing resources for shortest-path computation
17 Citations2012Alexandros Efentakis, Dimitris Theodorakis +1 more
This work aims for a Web-based navigation service that whenever users request a route, the service uses their browsers for partially preprocessing a large, but changing road network, and showcases a scalable approach, which almost eliminates the computing load on the server.