1 |
http://en.wikipedia.org/wiki/TPEG
|
2 |
Jung, S., and Pramanik, S., "An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps." IEEE Trans, Knowledge and Data Eng. Vol. 14, No. 5, 2002, pp. 1029-1046
DOI
ScienceOn
|
3 |
이현섭, 김진덕, "고정 그리드 기반 가변 휴리스틱을 이용한 최적경로 탐색," 한국해양정보통신학회 2005 추계 종합학술대회, Vol.9, No.2, pp.137-141, 2005
|
4 |
문대진, 조대수, "최저 속력 동적 휴리스틱을 이용한 경로탐색", 한국공간정보시스템학회 2008 Vol,19, No2, 2008
|
5 |
Peter E. Hart, Nils J. Nilsson and Bertram Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs," IEEE Trans. on Systems Science and Cybernetics, Vol. SSC-4, No. 2, pp 100-107, 1968
|
6 |
G. R. Jagadeesh, T. Srikanthan, and K. H. Quek, 'Heuristic Techniques for Accelerating Hierarchical Routing on Road Networks,' IEEE Trans. Intelligent Transportation Systems, Vol. 3, No 4, pp.301-309, 2002
DOI
ScienceOn
|
7 |
R. Jacob, M.V. Marathe, and K. Nigel, "A computational study of routing algorithms realistic transportation networks," presented at the Second Workshop on Algorithmic Engineering, NJ, 1998
|