交叉路의 遲滯時間을 利用한 交通配分模型에 關한 硏究 = A Study on Traffic Assignment Model using Delay Time at Intersection

다국어 초록 (Multilingual Abstract)

This study surveyed the efficiency of network method for traffic assignment by using delay time as link performance function resulted from KHCM and Webster. The results of this study can be summarized as follows.
The existing traffic assignment models used daily OD data to forecasting future segment volumes. For that reason in this study converts daily OD data into peak hour OD data based on person trip survey, and applies to traffic assignment. The algorithm for finding the minimum path is programed to calculate efficiently the existing minimum path. And then, using this, estimates segment volumes and compares these with current volumes by five link performance functions and assignment model of PATS. As a result, suitability of link performance functions are presented in order to delay of KHCM, Webster's delay, BPR formula of USA, BPR formula of Korea, Q-V curve. So link performance function for traffic assignment, using the delay time at intersection of KHCM or Webster is available.