U-TURN을 포함한 가로망 표현 및 최단경로의 구현

서지정보

· 발행기관 : 대한교통학회
· 수록지 정보 : 대한교통학회지 / 13권 / 3호
· 저자명 : 최기주

목차

ABSTRACT
Ⅰ. 서론
Ⅱ. 문헌조사(Literature Review)
Ⅲ. U-TURN을 위한 가로망의 표현 및 알고리즘 보완
Ⅳ. NA1 및 NA2의 비교 분석
Ⅴ. 결론
참고문헌

영어초록

This paper reviews both network representation schemes of transportation network and algorithms for finding the shortest path between two points in the network. Two types of network representation schemes for considering U-TURN have been proposed along with some modifications of the vine-based Dijkstra shortest path algorithm. The traditional Sioux-Fall network has been chosen and modified with the introduction of left-turn prohibitions and U-TURNs for the purpose of evaluating the performance of two modified algorithms and network representation schemes (NA1 and NA2). This type of modification in both network representation scheme (including network data) and algorithm is not only supposed to be needed for route guidance but supposed to contribute to finding more realistic path and estimating more accurate traffic volumes throughout the entire network.

참고자료

· 없음