Sign in

v57

latestOpenAPI 3.1.0LGPLraw.githubusercontent.com2026-08-07158456446.9 KB
search_journeys

Search possible journeys from A to B using train parts from the given timetables.

The trains are not simulated, meaning each stop needs to be dated in order to be taken into account. Until daily patterns are supported, timetables must be calendar anchored on 1970-01-01 UTC.

post/search_journeys

Request body

infra_idinteger required
start_msinteger required

Amount of milliseconds from 1970-01-01 00:00:00 UTC to the center of the start window.

The start window is defined as the time between start_sec - start_tolerance and start_sec + start_tolerance.

start_toleranceinteger required

Half the time of the start window in milliseconds.

The start window is defined as the time between start_sec - start_tolerance and start_sec + start_tolerance.

timetable_idsinteger[] required

Until daily patterns are supported, timetables must be calendar anchored on 1970-01-01 UTC.

transfer_msinteger required

Constant time for a transfer/footpath in the same stop in milliseconds.

The algorithm assumes that changing from one train to another in a stop always take this constant time.

Response

A list of journey proposals that match the input search query