Skip to content

Add methods for minimal path calculation making use of UBODT - #248

Open
ftapajos wants to merge 11 commits into
cyang-kth:masterfrom
ftapajos:master
Open

Add methods for minimal path calculation making use of UBODT#248
ftapajos wants to merge 11 commits into
cyang-kth:masterfrom
ftapajos:master

Conversation

@ftapajos

Copy link
Copy Markdown

It is more like a request for comment rather than a proper pull request. UBODT (or simply ODT data structure) has interesting properties that can be used for generating a set of shortest paths, which are very useful when modelling route choice using any discrete choice framework Prato, 2009.
Since route choice modelling usually comprises both map matching and route choice generation Menghini et al. 2010, reusing the same preexisting ODT entries to reduce processing time may benefit.
This code has been tested, but hasn't been benchmarked

@XingchenZOU

Copy link
Copy Markdown

Thanks for your work! Good

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants