Interop Summit 2018 Belgium - Open Transport Data

Interop Summit 2018 Belgium - Open Transport Data

In order to create a Belgian route planner, we need to combine an incredible amount of datasets published by an incredible amount of organizations. In Belgium and Flanders, I believe it’s a strength that we have a strong sense of decentralization: different problems are tackled by different organizations. Therefore, we must also see the challenge of creating a route planner as a decentralization task: how can we query over different open datasets published by different actors? This is the research I have been doing the last 5 years, after having met these problems as part at iRail ( for every new route planner, more than 80% of the time is put in expensive data integration due to bad publishing. Today, I want to start tackling by starting the development of an Open Source Route Planner which automates transport data integration on top of better published data. Let’s work together towards better interoperability.


Pieter Colpaert

February 21, 2018


  1. Maximizing the reuse of Open Transport Data Pieter Colpaert Ghent

    University – imec – Open Knowledge Belgium
  2. How far do you live from work?

  3. km or min?

  4. Imagine a program calculating distance in minutes What data would

    you need?
  5. Transport has become a data sharing problem How can we

    fix it?
  6. Schedules Contract 3★ dump API keys 3★ dump Contract 3★

    dump Open License 3★ dump Real-time Contract 3★ dumps API keys 3★ dump API keys beta-version no Historic no no no no
  7. Sharing data between client & server Your system Third party

    system Agree on a protocol Will determine which questions can be answered in a timely fashion Can ask questions to your system as previously agreed
  8. Sharing data on the Web Your system ? ? ?

    ? ? ? Mission: Automating the reuse process
  9. Can we find a way to publish public transport data

    as base registries?
  10. Data needed for algorithm a connection departureTime + departureStop arrivalTime

    + arrivalStop another connection departureTime + departureStop arrivalTime + arrivalStop
  11. time * The Connection Scan Algorithm (CSA) And this is

    the algorithm* ~ creating a minimum spanning tree through a sorted directed acyclic graph Squares are connections
  12. Resource X Resource ... Resource 2 Resource 1 time nextPage

    nextPage When published in pages on the Web, route planning will need X requests instead of 1
  13. Developer? Try it yourself at NEW Now with: RT,

    historic and planned data for SNCB No registration! Automate the integration of future datasets!
  14. A world where knowledge creates power for the many, not

    the few Questions? @pietercolpaert