Pierre-Léo Bourbonnais

When routing with an arrival time, the optimizations don't seem to be taken into account

1

See this screenshot for instance: there is a stop near the destination (red marker), but since to be there at the arrival time, it has enough time to disembark at...

Make sure we do not get an infinite loop when creating the journey steps and add tests to validate

4

Make sure we do not create an infinite loop here by verifying that the node index changes at every step See [forward_journey](https://github.com/chairemobilite/trRouting/blob/6e070306e67d5f0eccf7fb625ab243e40fbcb698/connection_scan_algorithm/src/forward_journey.cpp) line 120 (this should also be checked in...

reloading cache with the update request should fix empty data at launch

1

Example: when launching trRouting, if the scenarios cache file is empty or non existant, it will stay empty even if we update cache and reload a new scenario cache file...

verify that data is valid before generating journeys

4

the two while loops in forward and reverse journey can create memory leak (infinite push into a vector) when invalid data is found (like reverse travel times or incorrectly rounded/floored/ceiled...

Switch lat,lon string in queries to lon,lat to follow standard x,y and geojson format

1

Mega breaking change, we must find all references to trRouting calls everywhere!

Implement Raptor or Trip-Based or another transit routing algorithm that allows weightings

5

[Raptor](https://www.microsoft.com/en-us/research/wp-content/uploads/2012/01/raptor_alenex.pdf) [Trip-based](https://i11www.iti.kit.edu/_media/teaching/theses/ba-potthoff-20.pdf) and [Trip-Based presentation](https://algo2.iti.kit.edu/witt/talks/trip-based-public-transit-routing.pdf) I propose that we code this new algorithm in rust, but this needs further discussion

When there is enough time to do so, some trips will board or unboard at a far away node instead of using the nearest one on the same trip. We...