A machine learning-based approach to time-dependent shortest path queries
Road traffic is known to be time-dependent. The travel time of a road varies at different times of the day. Many algorithms have been proposed for finding a shortest path in a time-dependent road network. In this project, I explored an alternative approach that leveraged on GPS trajectories colle...
Saved in:
Main Author: | Wei, Yumou |
---|---|
Other Authors: | Xiao Xiaokui |
Format: | Final Year Project |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/70473 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Shortest path and distance queries on road networks : an experimental evaluation
by: Wu, Lingkun, et al.
Published: (2013) -
Efficient index structures for reachability and shortest path queries
by: Wang, Sibo
Published: (2016) -
Shortest path computation for roadway network
by: Khoo, Gilbert Teng Sheng
Published: (2016) -
Hardware-accelerated shortest path computation
by: Yeo, Wei Jie
Published: (2016) -
Field programmable gate array-based acceleration of shortest-path computation
by: Jagadeesh, George Rosario, et al.
Published: (2014)