Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory
- 21 March 2018
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 27 (3) , 321-345
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61232006, 61502324)
- Australian Research Council (LP130100164, DP170101172)
- National Natural Science Foundation of China (61532018)
This publication has 51 references indexed in Scilit:
- Time-series data miningACM Computing Surveys, 2012
- Time-Dependent SHARC-RoutingAlgorithmica, 2009
- Current map-matching algorithms for transport applications: State-of-the art and future research directionsTransportation Research Part C: Emerging Technologies, 2007
- SEGMENTING TIME SERIES: A SURVEY AND NOVEL APPROACH2004
- Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run TimeTransportation Research Record: Journal of the Transportation Research Board, 1998
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- A note on two problems in connexion with graphsNumerische Mathematik, 1959