Sign in

v52

latestOpenAPI 3.1.0LGPLraw.githubusercontent.com2026-08-04157452441.5 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.

post/search_journeys

Request body

infra_idinteger required
start_msinteger required

Amount of milliseconds from midnight 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
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