Better transit routing by exploiting vehicle GPS data

Delling, Daniel; Italiano, Giuseppe F.; Pajor, Thomas; Santaroni, Federico

doi:10.1145/2674918.2674923

Cited by 7 publications

(5 citation statements)

References 17 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They provide strong evidence that computing journeys according to the published timetable often fails to deliver optimal or even high-quality solutions. However, incorporating real-time GPS location data of vehicles into the journey planning algorithm helps improve the journey quality (e. g., in terms of the experienced delay) [13,84].…”

Section: Extended Scenariosmentioning

confidence: 99%

Route Planning in Transportation Networks

Bast

Delling

Goldberg

et al. 2016

Lecture Notes in Computer Science

Self Cite

448

388

View full text Add to dashboard Cite

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs. *

show abstract

Section: Extended Scenariosmentioning

confidence: 99%

Route Planning in Transportation Networks

Bast

Delling

Goldberg

et al. 2016

Lecture Notes in Computer Science

Self Cite

448

388

View full text Add to dashboard Cite

show abstract

“…The results extend the limited research into the potential disparity between accessibility model estimates based on the schedule and those based on real PT performance (e.g. Firmani et al, 2013;Allulli et al, 2014;Delling et al, 2014). Compared to the existing insights, which consider journey planners and do not attempt to quantify expected travel time error, this research considers deterministic and time-invariant (DTI) and stochastic and time-invariant (STI) network models in addition to a time-dependent one.…”

Section: Chapter 5 Discussionsupporting

confidence: 70%

“…This provides an opportunity to substitute schedules in accessibility models with data that describes how the real system operates. To date, few models have included AVL (Firmani et al, 2013;Allulli, Italiano & Santaroni, 2014;Delling, Italiano, Pajor & Santaroni, 2014). Our understanding of how influential AVL is on an accessibility model is limited.…”

Section: Problemmentioning

confidence: 99%

“…Like many DTI networks, most DTD models obey the timetable without consideration of how accurate the timetable actually is. Although little work has been done, there is evidence that journey planners 6 return considerably different results depending on whether the schedule or locationat-time AVL data are used to return shortest paths, at least in terms of the ranked order of route suggestions (Firmani et al, 2013, Allulli et al, 2014, and Delling et al, 2014 all consider Rome's General Transit Feed (GTF) against a municipal journey planner using location-at-time AVL data).…”

Section: Punctualitymentioning

confidence: 99%

See 1 more Smart Citation

Waiting and Weighting: Public Transportation Model Sensitivity to Waiting Time and Schedule Deviation

Law¹

View full text Add to dashboard Cite

Public transport (PT) is not famed for its dependability, yet current PT accessibility models presume that the schedule is an adequate reflection of reality. Consequently, it is implicit that PT vehicles always operate according to their schedule, and that all passengers arrive at random rather than plan their arrival. In reality, such assumptions do not always hold. The sensitivity of model results to such assumptions is largely untested. This thesis seeks to determine to what extent PT accessibility models based on the schedule are robust to substitution by automatic vehicle location (AVL) data on the real arrival times of PT vehicles. The inclusion of this high resolution data on punctuality enables the relaxation of assumptions about the random arrival of passengers, and the enumeration of expected waiting time in the presence of uncertain PT arrival time. Using an open standard for the publication of public transit information (the General Transit Feed Specification (GTFS)), this thesis develops a number of models ofWellington’s transit system, assuming that passengers arrive at random, and vehicles arrive punctually. Equivalent models are then built with AVL data from the Greater Wellington Regional Council’s real-time information (RTI) system. This information is used to determine actual service headways, headway variability, probability of service arrival over an interval, and realistic vehicle travel times. Results of pairwise comparisons of accessibility model outcomes indicate that for every definition of accessibility model considered, GTFS and AVL sources of information do not predict similar travel times. The magnitude and the direction of differences varied between model types, but in all cases were highly statistically significant. The results of the research are of use to transportation and accessibility modellers, who previously could not estimate travel time error associated with making assumptions about PT reliability and passenger arrival behaviour (implied by the use of PT schedules in models).

show abstract

“…Van der Hurk et al (2015) studied how to determine the realized path (i.e., the chosen route) of travelers given the entrance and exit points of a railway network, with the purpose of studying their behavior especially in disruption situations. Delling et al (2014) investigated the similar problem of integrating vehicle (position) information in the search for better route advice in transit networks.…”

Section: Passenger Guidance and Route Choicementioning

confidence: 99%

Interactions and Equilibrium Between Rescheduling Train Traffic and Routing Passengers in Microscopic Delay Management: A Game Theoretical Study

Corman

2020

Transportation Science

View full text Add to dashboard Cite

In the last decade, optimization models for railway traffic rescheduling mostly focused on incorporating an increasing detail of the infrastructure, with the goal of proving feasibility and quality from the point of view of the managers of the infrastructure (tracks and stations). Different approaches that manage only the passenger flows instead focus more explicitly on the quality of service perceived by the passengers. This paper investigates microscopic railway traffic optimization models and algorithms, merging these two streams of research. In particular, we analyze the characterization of an equilibrium point between the reordering choices of train dispatchers in railway traffic optimization and the route choice of passengers in the available services of the railway transport network. We describe how passenger choice at stations along the route intertwines deeply with the problem of rescheduling trains over tracks and station resources in a very complicated setting that might not exhibit equilibrium points in general. Delaying trains and/or dropping passenger connections and/or giving particular route advice to passengers might influence the behavior of traffic controllers and passengers, determining a trade-off between the delays of trains, weighted by the passenger load, and the travel time of passengers. We study this problem with a game theoretical approach, focusing on the solutions corresponding to Nash equilibria of a game involving passengers and infrastructure managers. The proposed game theoretical approach is able to easily consider information and interdependence of the actions of multiple stakeholders. Computational results based on a real-world Dutch railway network quantify the trade-off between the minimization of train delays and passenger travel times and the performance, stability, and convergence of the equilibrium point given different algorithms and information available. The final aim of this work is to study the impact of effective implementations of railway traffic management and dissemination of information to passengers and operators.

show abstract

Better transit routing by exploiting vehicle GPS data

Cited by 7 publications

References 17 publications

Route Planning in Transportation Networks

Route Planning in Transportation Networks

Waiting and Weighting: Public Transportation Model Sensitivity to Waiting Time and Schedule Deviation

Interactions and Equilibrium Between Rescheduling Train Traffic and Routing Passengers in Microscopic Delay Management: A Game Theoretical Study

Contact Info

Product

Resources

About