1 |
Korean National Transport Information Center, "Public Traffic Information Service," http://openapi.its.go.kr/
|
2 |
Korean National Transport Information Center, "Node Link Map," http://www.its.go.kr/nodelink/
|
3 |
OpenStreetMap Contributors, "OpenStreetMap," http://www.openstreetmap.org/
|
4 |
D. Gearhart, G. Knisely, K. Kreiser, K. DiLuca, and D. Nesbitt, "Valhalla," https://github.com/valhalla
|
5 |
H.-H. Nguyen, H.-Y. Jeong, "An Area Partitioning and Subgraph Growing Approach to the Conflation of Road Networks," http://vialab.pusan.ac.kr/lib/exe/fetch.php?media=Publication:apsg_vialab.pdf
|
6 |
OpenStreetMap. Ko: Map Features. https://wiki.openstreetmap.org/wiki/Ko:Map_Features
|
7 |
L. Zhao, T. Ohshima, and H. Nagamochi, "A* algorithm for the time-dependent shortest path problem," in Proc. of the 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp.36-43, 2008.
|
8 |
P. Hart, N. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. Syst. Sci. Cybern., vol.4, no.2, pp.100-107, 1968. DOI: 10.1109/TSSC.1968.300136
DOI
|