This component shows the results of applying the Trip-Chaining algorithm to the Smart Card
data for the bus service Bilbobus of the Bilbao Use Case. The algorithm computes the OD-matrixes, Specifically
it produces estimates of where the passengers that get into the bus at a given stop get off from it.
The module have two different modes of operation: Per Line and Per Trip.
The Per Line mode shows the results aggregated per each of the lines. So selecting one bus line from the menu on
the left and pressing the buttom "Get Line" it shows the resuls. In the map on the top the different bus stops for each for
the selected bus line are shown. On the bottom a chord diagrams shows with the yellow dots denoting the bus stops. By placing the mouse
on top of one of the points the chord diagram shows the results of where the passegers have dissembark. The same data are also shown
in a table on the left of the component.
It is worth mentioning that we have added fake bus stops with negative values denoting different reasons why the algorith does not
provide a reasonable answer. The values are aggregated over the whole set of the data which in our case is one month (Sept. 2021).
The Per Trip mode show the results on a whole trip basis, allowing transbordng within this trip. This implies that potentially
everystop of every bus line is potentially connected with every other one. In this mode, an initial bus stop needs to be selected from
the map and the results are shown on the table on the left of the componets. The bus stops that are more popular are colored from gray,
no trip ends, to yellow, small number of ends, to darked tones of red, many number of ends.