issues
search
licit-lab
/
MnMS
Agent-based Multimodal Urban Moblity Simulator resulting from the ERC MAGnUM project
GNU Lesser General Public License v3.0
10
stars
4
forks
source link
Speed up computation shortest path
#39
Closed
floriangc
closed
2 years ago
floriangc
commented
2 years ago
[ ] Car travel -> bypass shortest path by euclidian dist + detour ratio
[ ] Use a
scipy.spatial.KDTree
to speed up
mobility_nodes_in_radius
[ ] Study similarity between paths to see if a caching technics might speed up batch shortest path computation
[ ] Feasability of Contraction hierarchies or use an existing implementation
[ ] Keep computed shortest paths between simulation
[ ] Explore Numba/Cython framework
scipy.spatial.KDTree
to speed upmobility_nodes_in_radius