Loading the UK GTFS data feed

Recently I got involved with a customer that had build a journey/route finding for public transport systems. This topic has been high on my list to experiment with so I will use the Xmas break to play with some data.

I wanted to use the German Deutsche Bahn as an example, as I use them quite frequently and therefore have a good understanding of what a 'good' route would look like. Unfortunately, Deutsche Bahn does not provide usable data.

Bit of a rant: The Deutsche Bahn opened an API, but it is close to useless, as one would have to build a crawler that glues all the bits and pieces the API provides together. Besides, it is rate limited. For my use case, I only need data for the train schedule. The Deutsche Bahn must have the data available, as it provides a GTFS feed, but only for Google. There is a project on Github that tries do solve that, but I could not get it to work. Then there is GTFS.de that claims to provide data, but the free tier is rather limited.

After spending way to much time trying to get schedule data for the German train systems, I gave up and just used the UK data.

GTFS is the semi-standard developed by Google and many transport companies provide their data in this format. There is also the friendly public transport format which I found a good read and I recommend to read falsehoods programmer believe.

Now pathfinding in public transport is such a natural fit for a graph database that of course colleagues of mine have written about it before.

Rik Van Bruggen blogged back in 2015 about loading GTFS data into Neo4j. I will mostly follow Rik’s examples, updated to reflect the current state of Neo4j’s Cypher syntax.

Adam Cowley blogged about Journey Planning and derives a graph model. I may come back and borrow bits from there, but as I’m not planning to use pure Cypher I will stay close to Rik (and therefore the GTFS) model.

Google provides some documentation for GTFS, in the end, it is a set of *.txt files zipped together. These *.txt files are actually CSV files, which allows us to import them with the LOAD CSV command from Neo4j’s Cypher.

The basic building blocks are:

  • agency.txt: describes the companies running trains/busses/.. contained in the set

  • stops.txt: information about places where trains/busses/.. stop and allow for embarking. Contains data such as Name, geo-location and others. Stops might build a hierarchy (but not in the UK data set used here)

  • stop_times.txt: contains arrival and departure times for trips at a stop along with some other optional information

  • trips.txt: the above stop_times use a trip_id, these are defined in here and bound to route_id and service_id

  • routes.txt: bind one or more trips together and provides additional information, such as the agency and naming

  • calendar.txt: provides information on which weekdays the services from the trips.txt are running

  • transfer.txt: minimum required time to change train/bus/…​ at a stop.

There are more (optional) files and data points that can be contained in a GTFS feed (esp. fares information), but the UK set does not contain it and for our little experiment we are not needing them. There is nothing explicit in the GTFS data about recurring services, say a train that is running every hour from A to B. Each of them will be an additional set of entries in the stop_times.txt file. For a busy subway service that runs every 5 minutes, this will lead to a lot of STOPS_AT relationships. This might impact performance and we might remodel this later on.

The resulting schema in the database will represent this:

GTFS graph schema
Figure 1. GTFS graph schema

I created some constraints to ensure uniqueness and created indexes on the properties the import will match/merge against.

The data is simple enough to use a LOAD CSV inside a simple Cypher script. The script creates all the nodes and relationships while converting data into Neo4j types. It also creates the NEXT_STOP relationships between the StopPoint nodes in the right order, building the chain of stops of a trip.

The arrival and departure time information on the StopPoint is basically a 24h format but allows for hours greater than 23 for trips that carry on over midnight. For now we keep the original string representation and store it as a duration offset. This duration will hold the offset from midnight ('00:00:00') on the day of the trip start.

Exploring the imported data

The GTFS documentation on routes.txt and service_id is not very clear, so I will try to extract the meaning from the data.

The geo-information on the stops is stored as Neo4j Point type, allowing the usage of NeoMap inside of Neo4j Desktop to quickly verify the locations of the imported Stops:

NeoMap displaying stops
Figure 2. NeoMap displaying stops

This will also alert us that there is at least one stop with incorrect latitude/longitude information (at 0/0). Something to be aware of when we are starting to use the location information.

After the import, we have the following nodes and relationships in our database:

Type Count





















To get a feeling of the data distribution, I used the NeoDash App to visually explore some metrics. The configuration/queries I used can be imported from here

The first chart shows the distribution of StopTime to Stop, e.g. how many Trip stop at a Stop. When we start to include service changes into the routing, this will impact performance as for busy Stops, more possibilities need to be explored.

Distribution of STOPS_AT by Stop
Figure 3. Distribution of STOPS_AT by Stop

As we can see, the vast majority of stops have a limited set of Trips stopping, but there are a few busy stops, as was to be expected.

The following query will list us the 10 most busy stops in our database:

match (s:Stop)<-[r:STOPS_AT]-() return s.name, count(r) as cnt order by cnt desc limit 10
Stop name Count

Clapham Junction


London Bridge


London Victoria


London Waterloo


Willesden Junction


New Cross


East Croydon


London Liverpool Street


Bethnal Green




I was wondering about the meaning of the service_id on the trip data and looked at the distribution of service_id to trip:

Distribution of service_id
Figure 4. Distribution of service_id

Again an uneven distribution. To understand the usage of the service_id on our data, let’s find the trips that use the same set of Stop s:

match (t:Trip)<-[:BELONGS_TO]-()-[:STOPS_AT]->(s)
 with {trip : t.id, stops : collect(s.code)} as trips
 with trips.stops as stops, collect(trips.trip) as trips where size(trips) > 5
 return trips, stops order by size(stops) desc limit 10
Trips Stops





















Looking at the second entry, we can see on MeoMap that this is a short trip on the British east coast:

Sample trip
Figure 5. Sample trip

With the following query:

match (t:Trip)<-[:BELONGS_TO]-(st)
    where t.id in ["137296", "155980", "244620", "273057", "273062", "292829"]
  with t, st.departureTime as time order by t, st.stopSequence asc
return t.id, collect(time) as timing order by timing asc

we can see the departure timing for the involved trips:

Trip ID Timing













The timings look off, as the time between the first 2 stops is different. Looking at the attached Route and the order of the Stop s, we see that half of the trips from Manningtree to Harwich Town and the other half return on the same route. Only 2 of these trips share the same service_id.

So in GTFS terms (and hence in our model), the Route is what in "Layman’s terms" is a service, but only in one direction, while the service_id is only used to bind weekdays to trips.

Finding routes

To find a journey, we need to match the start and end stop and then traverse along the graph:

match p=(start:Stop)<-[:STOPS_AT]-()-[:NEXT_STOP*]->()-->(dest:Stop)
where start.name = 'Aberdeen' and dest.name = 'Penzance'
return p

Which will list 4 possible connections. We just found a way across the UK in under 100 ms. But, as you might have noticed, we did not specify the (week) day or departure time. Adding this:

match (start:Stop)<-[:STOPS_AT]-(st)-[:BELONGS_TO]->(t)
with st where start.name = 'Aberdeen' and t.saturday = true and st.departureOffset.seconds > duration({hours:7}).seconds
match (dest:Stop) where dest.name = 'Penzance' with dest, st
match p=(st)-[:NEXT_STOP*]->()-->(dest:Stop)
return p

While this shows the power of using a graph database, it does not really solve our problem, as the more interesting journeys will involve changing the train/bus/.. We would need to change the -[:NEXT_STOP*]→ unbounded path expansion to allow for this. Unfortunately, our current model does not cope very well for this. Adam Cowley solved it by adjusting the model to allow for this kind of queries.

But even with the change in the model, using a pure Cypher based approach will not allow us to take all the rules that apply to the UK railroads into account. Apart from the minimum change time we already loaded into the database (from the transfer.txt file), there are additional rules, esp. the routing guide to take into consideration.

The way to solve this is by using the Java API of Neo4j directly, as it provides the flexibility we need. I will explore the development of a plugin that uses the API for this use-case in future posts.