Smart Card Data in Public Transport Paul Bouman Also based on work - PowerPoint PPT Presentation

Department of Technology & Operations Management Smart Card Data in Public Transport Paul Bouman Also based on work of: Evelien van der Hurk, Timo Polman, Leo Kroon, Peter Vervest and Gábor Maróti Complexity in Public Transport: http://www.computr.eu

NETHERLANDS RAILWAYS (NS) IN NUMBERS

NETHERLANDS RAILWAYS (NS) IN NUMBERS 1,1 ⋅ 10 6 Journeys per weekday 16.8 ⋅ 10 9 Yearly Passenger km’s 97.4 % Train Punctuality 1.5 % Cancelled Trains 4800+ Train Services per Weekday 3000+ Train Wagons/Drivers

NETHERLANDS RAILWAYS (NS) IN NUMBERS 1,1 ⋅ 10 6 Journeys per weekday 16.8 ⋅ 10 9 Yearly Passenger km’s 97.4 % Train Punctuality 1.5 % Cancelled Trains 4800+ Train Services per Weekday 3000+ Train Wagons/Drivers

SMART CARD DATA (AUTOMATED FARE COLLECTION) • Dutch “OV - chipkaart” • Always both check-in and check-out • Some differences between modalities … CardID Location Time Type … 543465 Harderwijk 13:42 CHECKOUT … 654345 Amsterdam 13:43 CHECKIN … … … … …

OVERVIEW • Introduction • Finding Passenger Routes From smart card transactions to routes • A Better Way to Measure Service Quality New Service Indicators from the perspective of the passenger • Analyzing Demand Insight into passenger demand enables better service design • Discussion, Conclusion

FROM SMART CARD AND TIMETABLE DATA TO PASSENGER ROUTES

PASSENGER ROUTE CHOICE Knowledge on passenger route choice provides • Estimate demand for capacity • Test assumptions on passenger behavior and route choice • Hind-sight analysis of passenger service (delays) Until now: • Surveys and panel data to deduce route choice • Models for route choice: maximum utility, regret minimization ,… Now: • We have both the Smart Card Data and conductor checks to determine the routes used by a passenger. Why not use them?

PROBLEM OVERVIEW ROUTE DEDUCTION FROM AFC • Which route (time, space, trains) did a passenger take? Time Time +Station +Station ci co Conductor check Platform i Platform Station A Station B k trains • co ci time

PROBLEM OVERVIEW ROUTE DEDUCTION FROM AFC • Which route (time, space, trains) did a passenger take? Time Time +Station +Station ci co Conductor Step 1: check How can we find these route options? Platform i Platform Station A Station B k trains • co ci time

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn Ledn Ledn 9:09 9:12 9:16 9:21 9:25 Gvc Gvc Gvc Gvc Gvc 9:09 9:12 9:16 9:21 9:25 Dt Dt Dt Dt Dt 9:09 9:12 9:16 9:21 9:25

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn Ledn Ledn 9:09 9:12 9:16 9:21 9:25 Gvc Gvc Gvc Gvc Gvc 9:09 9:12 9:16 9:21 9:25 Dt Dt Dt Dt Dt 9:09 9:12 9:16 9:21 9:25

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Problem Transferring to another train is “free”. However, most passengers will prefer to stay in the same train if only a small Ledn Ledn Ledn Ledn Ledn 9:09 9:12 9:16 9:21 9:25 amount of time is saved. Gvc Gvc Gvc Gvc Gvc 9:09 9:12 9:16 9:21 9:25 Dt Dt Dt Dt Dt 9:09 9:12 9:16 9:21 9:25

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 Gvc Gvc Gvc 9:09 9:12 9:16 Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 Gvc Gvc Gvc 9:09 9:12 9:16 Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 D A Gvc Gvc Gvc 9:09 9:12 9:16 D A Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 D A Gvc Gvc Gvc 9:09 9:12 9:16 D A Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Problem Ledn Ledn Ledn 9:09 9:12 9:16 Whether a transfer is feasible may depend on the platforms of the trains. D A Gvc Gvc Gvc 9:09 9:12 9:16 D A Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 D A Gvc Gvc Gvc Gvc 9:09 9:12 9:13 9:16 D A Dt Dt Dt 9:09 9:12 9:16

FROM THE TIMETABLE TO AN EVENT ACTIVITY NETWORK Ledn Ledn Ledn 9:09 9:12 9:16 D A Gvc Gvc Gvc Gvc 9:09 9:12 9:13 9:16 D A Dt Dt Dt 9:09 9:12 9:16

TO SUMMARIZE • We have a ‘Basic Event Activity Network’ where transfers are ‘free’ that contains an arc for each scheduled trip in the timetable • We have a ‘Extended Event Activity Network’ where we can include penalties on the transfers and make sure that some slack time is included when the passenger makes a transfer.

COMPUTING SHORTEST PATHS • We use this procedure to obtain an Event-Activity Network 𝐻 = (𝑊, 𝐵) • Every node in the graph has a time label • If we assume every arc in the graph is associated with an action that takes a strictly positive amount of time, we have a Directed Acyclic Graph • When constructing the graph, we can use the time indices to obtain a Topological Ordering of the graph 𝑊 ≔ {𝑤 1 , 𝑤 2 , … , 𝑤 𝑜 } such that ∀ 𝑤 𝑗 , 𝑤 𝑘 ∈ 𝐵 ∶ 𝑗 < 𝑘 • We can use this to compute a Shortest Path Tree in 𝑃( 𝐵 ) time. For repeated computations on 20-50k Origin/Destination pairs, this matters. • Using different cost parameters for the different types of arcs, we can generate paths that favor or avoid different types of routes.

PROBLEM OVERVIEW ROUTE DEDUCTION FROM AFC • Now we have a set of possible routes. Time Time +Station +Station ci co Conductor check Platform i Platform Station A Station B k trains • co ci time

PROBLEM OVERVIEW ROUTE DEDUCTION FROM AFC • Now we have a set of possible routes. Step 2: Time Time +Station Which path should we +Station ci co choose, given the check in Conductor check and check out? Platform i Platform Station A Station B k trains • co ci time

METHOD • Generate routes based either on – The basic Event-Activity Network – The extended Event-Activity Network • From these, we pick one according to a fixed rule: 1) First Departure (FD) 2) Earliest Arrival (EA) 3) Latest Arrival (LA) 4) Least Transfers (LT) 5) Maximum Path Length (MPL) 6) Select Least Transfers Last Arrival (STA) • We will validate the methodology using conductor checks: – Did we even find the correct route during route generation? – Does our rule pick the correct route?

DATA • Smart card data – Origin station, destination station, start time, end time, card id • Realized timetable – Departure time station, arrival time station, train number • Conductor checks – Card id, time, train number General:  5 days  Over 500,000 journeys,  For a significant number of journeys, we have a conductor check  Full Dutch railway network of Netherlands Railways trains

RESULTS Method Observed Path Generated Basic Network 75,5% Ext. Network 92,3% Rule Basic Network Ext. Network First Departure 65% 86% Earliest Arrival 67% 86% Last Arrival 65% 86% Least Transfers 68% 90% Max. Path Length 70% 92% Selected Least T. 73% 95% NB: These are percentages over the set of journeys for which the correct path was generated.

DISCUSSION OF RESULTS • When constructing the Event-Activity Network, transfers matter for your succes rate. • Rules solely based on either the arrival or departure time are outperformed by those which include the number of transfers. • The “ Selected Least Transfers” rule performs best, as it combines the idea of minimizing transfers with the idea that a passenger will likely depart within 10 minutes of check in and check out within 10 minutes of arrival.

MEASURING PASSENGER DELAYS

MEASURING SERVICE QUALITY • Recall: punctuality score of NS is quite high (a little higher than 97%). • This refers to ‘ train punctuality ’ Did the train arrive within five minutes of the timetable? • Passengers mostly care whether they reach their destination in time. ‘ Passenger punctuality ’ would be a better indicator of service quality. – In case of transfers, small train delays can have a big impact on the passenger delays. – In some situations, delays can be lead to additional transfer opportunities • How can we measure this? (MSc. Thesis of Timo Polman) • Should be controllable (e.g. the cause can be determined), robust (e.g. not depend on shopping behavior at a station) and simple.

METHODOLOGY Smart Card Journey Generate planned route Planned Timetable Execute planned route Realised Timetable Calculate Delay

METHODOLOGY When the planned route is Smart Card Journey feasible, use that. If not, recalculate from the first point where it is infeasible. Generate planned route Planned Timetable Execute planned route Realised Timetable Calculate Delay

SOME DELAY MEASURES • Average Delay (Gross Passenger Delay Minutes / Lost Customer Hours) • Relative delay: • Delay divided by planned journey time