A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem
transportation
routing
a-star
convolution
pathfinding-algorithm
routing-algorithm
shortest-path-problem
shortest-path-routing-algorithm
arrival
transportation-network
dijkstra-shortest-path
transportation-planning
shortest-pathfinding-algorithm
transportation-problem
stochastic-models
stochastic-dynamic-programming
reliable-routing
-
Updated
Aug 30, 2019 - Python
as a solution to issue #33
when a query point is equal to a vertex of the boundary polygon it should be assumed that this point lies within the polygon in order to enable paths.
ATTENTION: for hole polygons it must be assumed that vertices lie outside!