References
- Carlyle, W.M., Royset, J.O., and Wood, R.K., 2008. Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks, 52 (4), 256–270. doi:https://doi.org/10.1002/net.20247
- Chabini, I. and Lan, S., 2002. Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transportation Systems, 3 (1), 60–74. doi:https://doi.org/10.1109/6979.994796
- Chen, B.Y., et al. 2014. Map-matching algorithm for large-scale low-frequency floating car data. International Journal of Geographical Information Science, 28 (1), 22–38. doi:https://doi.org/10.1080/13658816.2013.816427
- Delling, D., et al. 2017. Customizable route planning in road networks. Transportation Science, 51 (2), 566–591. doi:https://doi.org/10.1287/trsc.2014.0579
- Desrochers, M. and Soumis, F., 1988. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR: Information Systems and Operational Research, 26 (3), 191–212.
- Fredman, M.L. and Tarjan, R.E., 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34 (3), 596–615. doi:https://doi.org/10.1145/28869.28874
- Geisberger, R., et al. 2012. Exact routing in large road networks using contraction hierarchies. Transportation Science, 46 (3), 388–404. doi:https://doi.org/10.1287/trsc.1110.0401
- Gong, Y.J., et al. 2018. AntMapper: an ant colony-based map matching approach for trajectory-based applications. IEEE Transactions on Intelligent Transportation Systems, 19 (2), 390–401. doi:https://doi.org/10.1109/TITS.2017.2697439
- Greenfeld, J.S., 2002. Matching GPS observations to locations on a digital map. In: Proceedings of the 81th Annual Meeting of the Transportation Research Board, Washington, DC.
- Hsueh, Y.L. and Chen, H.C., 2018. Map matching for low-sampling-rate GPS trajectories by exploring real-time moving directions. Information Sciences, 433-434, 55–69. doi:https://doi.org/10.1016/j.ins.2017.12.031
- Irnich, S. and Desaulniers, G., 2005. Shortest path problems with resource constraints. In: G. Desaulniers, J. Desrosiers and M.M. Solomon, eds., Column Generation, 33–65. Boston, MA: Springer, US.
- Karduni, A., Kermanshah, A., and Derrible, S., 2016. A protocol to convert spatial polyline data to network formats and applications to world urban road networks. Scientific Data, 3 (1), 1–7. doi:https://doi.org/10.1038/sdata.2016.46
- Kubicka, M., et al. 2018. Comparative study and application-oriented classification of vehicular map-matching methods. IEEE Intelligent Transportation Systems Magazine, 10 (2), 150–166. doi:https://doi.org/10.1109/MITS.2018.2806630
- Liu, S., Ni, L.M., and Krishnan, R., 2014. Fraud detection from taxis‘ driving behaviors. IEEE Transactions on Vehicular Technology, 63 (1), 464–472. doi:https://doi.org/10.1109/TVT.2013.2272792
- Lou, Y., et al., 2009. Map-matching for low-sampling-rate GPS trajectories. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 352–361. New York, NY: ACM.
- Mehlhorn, K. and Näher, S., 1999. LEDA: a platform for combinatorial and geometric computing. Cambridge: Cambridge university press.
- Miwa, T., et al., 2012. Development of map matching algorithm for low frequency probe data. Transportation Research Part C: Emerging Technologies, 22, 132–145. doi:https://doi.org/10.1016/j.trc.2012.01.005
- Paixão, J.M. and Santos, J.L., 2013. Labeling methods for the general case of the multi-objective shortest path problem–a computational study. In: A. Madureira, C. Reis and V. Marques, eds., Computational Intelligence and Decision Making, 489–502. Dordrecht: Springer Dordrecht.
- Pugliese, L.D.P. and Guerriero, F., 2013. A survey of resource constrained shortest path problems: exact solution approaches. Networks, 62 (3), 183–200. doi:https://doi.org/10.1002/net.21511
- Quddus, M. and Washington, S., 2015. Shortest path and vehicle trajectory aided map-matching for low frequency GPS data. Transportation Research Part C: Emerging Technologies, 55, 328–339. doi:https://doi.org/10.1016/j.trc.2015.02.017
- Quddus, M.A., Ochieng, W.Y., and Noland, R.B., 2007. Current map-matching algorithms for transport applications: state-of-the art and future research directions. Transportation Research Part C: Emerging Technologies, 15 (5), 312–328. doi:https://doi.org/10.1016/j.trc.2007.05.002
- Rahmani, M. and Koutsopoulos, H.N., 2013. Path inference from sparse floating car data for urban networks. Transportation Research Part C: Emerging Technologies, 30, 41–54.
- Sama, K., et al., 2018. Learning how to drive in blind intersections from human data. In: 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 317–324. Miyazaki, Japan: IEEE.
- Van Sickle, J., 2015. GPS for land surveyors. Boca Raton, Florida: CRC Press.
- Wang, H., et al., 2019. A simple baseline for travel time estimation using large-scale trip data. ACM Transactions on Intelligent Systems and Technology, 10 (2), 1–22.
- White, C.E., Bernstein, D., and Kornhauser, A.L., 2000. Some map matching algorithms for personal navigation assistants. Transportation Research Part C: Emerging Technologies, 8 (1), 91–108.
- Williams, E., 2011. Aviation Formulary V1. 46. Available on line at https://www.edwilliams.org/avform.htm, November 2020.
- Yuan, J., et al., 2010. An interactive-voting based map matching algorithm. In: 2010 Eleventh International Conference on Mobile Data Management, 43–52. Kansas City, MO: IEEE.
- Zhu, L., Holden, J.R., and Gonder, J.D., 2017. Trajectory segmentation map-matching approach for large-scale, high-resolution GPS data. Transportation Research Record: Journal of the Transportation Research Board, 2645 (1), 67–75.