• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.7-17
• /
• 2004

지금까지의 링크통행시간에 대한 연구는 개별 차량의 평균을 통한 평균링크통행시간 산정 및 추정의 제한적인 연구가 대부분이었다. 그러나, 링크통행시간은 교통조건, 신호운영조건, 도로조건 등 다양한 영향인자로 인해 통행시간 분포가 구분되는 특성을 나타낸다. 따라서, 링크통행시간 특성을 좀 더 미시적으로 분석할 필요가 있다. 본 연구에서는 GPS를 이용한 실시간 교통자료 수집의 방법에 대해 살펴보았으며, GPS를 이용한 RTK 측량을 이용한 실시간 자료수집을 통하여 링크통행시간에 대한 연구를 수행하였다. 또한, 신호운영에 의한 영향으로 인한 링크통행시간 분포특성을 분석하기 위해 링크통행시간에 대한 현장조사를 추가적으로 실시하였다. 현장조사 결과분석을 통해 통행시간 분포특성 및 원인을 분석하고 프로그램을 이용한 시뮬레이션을 통해 보다 다양한 조건을 부여하여 링크통행시간분포비율에 영향을 주는 변수들에 대한 검토하고 통행시간 분포비율을 추정할 수 있는 모형을 구축하였다. GPS 실험차량을 이용한 주행실험결과를 분석한 결과 순행시간으로만 이루어지는 링크통행시간과 적색시간 동안 대기하였다가 링크구간을 통과하여 순행시간에 신호 대기시간을 더한 링크통행시간으로 통행시간이 구분되는 현상을 확인할 수 있었으며 따라서, 링크통행시간에 대한 분석은 통행시간을 하나의 평균통행시간으로 인식하는 것보다 두 개의 구분된 통행시간을 동시에 고려하는 것이 바람직할 것으로 판단되었다. 링크통행시간 분포특성에 대한 연구결과 또한, 통행시간이 양분되어 분포하는 것으로 분석되었다. 따라서, 링크통행시간의 경우 평균통행시간에 의한 결과보다 신호지체가 발생하지 않는 통행시간과 신호지체가 발생하는 통행시간으로 구분하는 것이 교통상황을 인식하는 것이 바람직할 것으로 나타났다.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.19-30
• /
• 2005

The objective of this research is to keep track of path travel time using methods of collecting traffic data. Users of traffic information are looking for extensive information on path travel time, which is referred to as the time taken for traveling from the origin to the destination. However, all the information available is the average path travel times, which is a simple sum of the average link travel times. The average path travel time services are not up to the expectation of traffic information consumers. To improve provide more accurate path travel time services, this research makes a number of different estimates of various path travel times on one path, assuming it will be under the same condition, and provides a range of estimates with their probabilities to the consumers, who are looking for detailed information. To estimate the distribution of the path travel times as a combination of link travel times. this research analyzes the relation between the link travel time and path travel time. Based on the result of the estimation. this research develops the algorithm that combines the distribution of link travel time and estimates the path travel time based on the link travel times. This algorithm was tested and proven to be highly reliable for estimating the path traffic time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.2D
• /
• pp.233-239
• /
• 2006

Most research for until at now link travel time were research for mean link travel time calculate or estimate which uses the average of the individual vehicle. however, the link travel time distribution is divided caused by with the impact factor which is various traffic condition, signal operation condition and the road conditional etc. preceding study result for link travel time distribution characteristic showed that the patterns of going through traffic were divided up to 2 in the link travel times. therefore, it will be more accurate to divide up the link travel time into the one involving delay and the other without delay, rather than using the average link travel time in terms of assessing the traffic situation. this study is it analyzed transit hour distribution characteristic and a cause using examine to the variables which give an effect at link travel time distribute using simulation program and determinate link travel time distribute ratio estimation model. to assess the distribution of the link travel times, this research develops the regression model and the fuzzy model. the variables that have high level of correlations in both estimation models are the rest time of green ball and the delay vehicles. these variables were used to construct the methods in the estimation models. The comparison of the two estimation models-fuzzy and regression model- showed that fuzzy model out-competed the regression model in terms of reliability and applicability.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.199-209
• /
• 2008

This paper is described the concepts and limitations for the traditional directional design hour volume estimation. The main objective of this paper is to establish an estimation method of probabilistic directional design hour volume in order to improve the limitation for the traditional approach method. To express the traffic congestion of specific road segment, this paper proposed the link travel time as the probability that the road capacity can accommodate a certain traffic demand at desired service level. Also, the link travel time threshold was derived from chance-constrained stochastic model. Such successive probabilistic process could determine optimal ranked design hour volume and directional design hour volume. Therefore, the probabilistic directional design hour volume can consider the traffic congestion and economic aspect in road planning and design stage. It is hoped that this study will provide a better understanding of various issues involved in the short term prediction of directional design hourly volume on different types of roads.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of Korean Society of Transportation
• /
• v.16 no.4
• /
• pp.225-237
• /
• 1998

본 연구의 목적은 가로망의 구조 및 통행수요의 변화에 따라 통행 중 교통정보제공의 효과가 어떻게 달라지는가를 모의실험을 통하여 분석하고자 하는 것이다. 이를 위하여 본 연구에서는 실제의 대규모 가로망에 대하여 적용할 수 있는 통행배정기법을 제안하였다. 제안된 모형은 시간의 흐름에 따른 가로망의 상태를 고려하여 통행을 배정하는 방법으로 $\ulcorner$시간종속적 통행배정$\lrcorner$이라 명하였다. 본 연구에서는 가로망 형태(격자형 및 방사환상형), 가로망 크기, 통행수요의 지역별 분포, 그리고 교통혼잡정도에 따라 각각 시나리오를 작성하고, 각 시나리오에 대하여 모의실험 및 사례연구(노드 348개, 링크 1179개)를 통해 정보를 받는 차량의 비율에 따른, 그리고 정보를 제공하는 빈도에 따른 통행중 교통정보제공에 대한 효과를 분석하였다. 연구 결과, 모의실험에서는 정보를 받는 차량의 비율이 30%~70% 구간에서 14%까지의 총체계비용의 감소효과가 나타났으며, 가로망의 규모가 클수록, 혼잡이 심할수록, 그리고 대안도로가 많을수록 교통정보제공의 효과는 커지는 것으로 분석되었다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.2
• /
• pp.64-79
• /
• 2023

This study reviewed the process of applying the Monte Carlo simulation technique to the traffic allocation problem of metropolitan subways. The analysis applied the assumption of a normal distribution in which the travel time information of the inter-station sample is the basis of the probit model. From this, the average and standard deviation are calculated by separating the traffic between stations. A plan was proposed to apply the simulation with the weights of the in-vehicle time of individual links and the walking and dispatch interval of transfer. Long-distance traffic with a low number of samples of 50 or fewer was evaluated as a way to analyze the characteristics of similar traffic. The research results were reviewed in two directions by applying them to the Seoul Metropolitan Subway Network. The travel time between single stations on the Seolleung-Seongsu route was verified by applying random sampling to the in-vehicle time and transfer time. The assumption of a normal distribution was accepted for sample sizes of more than 50 stations according to the inter-station traffic sample of the entire Seoul Metropolitan Subway. For long-distance traffic with samples numbering less than 50, the minimum distance between stations was 122Km. Therefore, it was judged that the sample deviation equality was achieved and the inter-station mean and standard deviation of the transport card data for stations at this distance could be applied.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.49-59
• /
• 2001

In the transportation planning process, origin and destination(O-D) trip matrix is one of the most important elements. There have been developments and applications of the methodology to adjust old matrices using link traffic counts. Commonly, the accuracy of an adjusted O-D matrix depends very much on the reliability of the input data such as the numbers and locations of traffic counting points in the road network. In the real application of the methodology, decisions on the numbers and locations of traffic counting points are one of the difficult problems, because usually as networks become bigger, the numbers of traffic counting points are required more. Therefore, this paper investigates these issues as an experiment using a nationwide network in Korea. We have compared and contrasted the set of link flows assigned by the old and the adjusted O-D matrices with the set of observed link flows. It has been analyzed by increasing the number of the traffic counting points on the experimental road network. As a result of these analyses, we can see an optimal set of the number of counting links through statistical analysis, which are approximately ten percentages of the total link numbers. In addition, the results show that the discrepancies between the old and the adjusted matrices in terms of the trip length frequency distributions and the assigned and the counted link flows are minimized using the optimal set of the counted links.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.23-34
• /
• 2009

This paper is described as an experimental analysis for the probabilistic directional design hour volume estimation. The main objective of this paper is to derive acceptable design rankings, PK factors, and PD factors. In order to determine an appropriate distribution for acceptable design rankings, 12 probability distribution functions were employed. The parameters were estimated based on the method of maximum likelihood. The goodness of fit test was performed with a Kolmogorov-Smirnov test. The Beta General distribution among the probability distributions was selected as an appropriate model for 2 lane roadways. On the other hand, the Weibull distribution is superior for 4 lanes. The method of the inverse cumulative distribution function came up with an acceptable design ranking of design for LOS D. An acceptable design ranking of 2 lanes is 190, while an acceptable design ranking for 4 lanes is 164. The PK factor and PD factor of 2 lanes was elicited for 0.119 (0.100-0.139) and 0.568 (0.545-0.590), respectively. On the other hand, the PK factor and PD factor for 4 lanes was elicited as 0.106 (0.097-0.114) and 0.571 (0.544-0.598), respectively.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.3
• /
• pp.66-77
• /
• 2014

UTIS(Urban Traffic Information System) directly collects link travel time in urban area by using probe vehicles. Therefore it can estimate more accurate link travel speed compared to other traffic detection systems. However, UTIS includes some missing data caused by the lack of probe vehicles and RSEs on road network, system failures, and other factors. In this study, we suggest a new model, based on k-NN algorithm, for imputing missing data to provide more accurate travel time information. New imputation model is an adaptive k-NN which can flexibly adjust the number of nearest neighbors(NN) depending on the distribution of candidate objects. The evaluation result indicates that the new model successfully imputed missing speed data and significantly reduced the imputation error as compared with other models(ARIMA and etc). We have a plan to use the new imputation model improving traffic information service by applying UTIS Central Traffic Information Center.