• Title/Summary/Keyword: link travel time

Search Result 125, Processing Time 0.027 seconds

Comparison Study of O/D Estimation Methods for Building a Large-Sized Microscopic Traffic Simulation Network: Cases of Gravity Model and QUEEENSOD Method (대규모 미시교통시뮬레이션모형 구축을 위한 O/D 추정 방법 성능 비교 - 중력모형과 QUEENSOD 방법을 중심으로 -)

  • Yoon, Jung Eun;Lee, Cheol Ki;Lee, Hwan Pil;Kim, Kyung Hyun;Park, Wonil;Yun, Ilsoo
    • International Journal of Highway Engineering
    • /
    • v.18 no.2
    • /
    • pp.91-101
    • /
    • 2016
  • PURPOSES : The aim of this study was to compare the performance of the QUEENSOD method and the gravity model in estimating Origin-Destination (O/D) tables for a large-sized microscopic traffic simulation network. METHODS : In this study, an expressway network was simulated using the microscopic traffic simulation model, VISSIM. The gravity model and QUEENSOD method were used to estimate the O/D pairs between internal and between external zones. RESULTS: After obtaining estimations of the O/D table by using both the gravity model and the QUEENSOD method, the value of the root mean square error (RMSE) for O/D pairs between internal zones were compared. For the gravity model and the QUEENSOD method, the RMSE obtained were 386.0 and 241.2, respectively. The O/D tables estimated using both methods were then entered into the VISSIM networks and calibrated with measured travel time. The resulting estimated travel times were then compared. For the gravity model and the QUEENSOD method, the estimated travel times showed 1.16% and 0.45% deviation from the surveyed travel time, respectively. CONCLUSIONS : In building a large-sized microscopic traffic simulation network, an O/D matrix is essential in order to produce reliable analysis results. When link counts from diverse ITS facilities are available, the QUEENSOD method outperforms the gravity model.

An Efficient Filtering Technique of GPS Traffic Data using Historical Data (이력 자료를 활용한 GPS 교통정보의 효율적인 필터링 방법)

  • Choi, Jin-Woo;Yang, Young-Kyu
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.3
    • /
    • pp.55-65
    • /
    • 2008
  • For obtaining telematics traffic information(travel time or speed in an individual link), there are many kinds of devices to collect traffic data. Since the GPS satellite signals have been released to civil society, thank to the development of GPS technology, the GPS has become a very useful instrument for collecting traffic data. GPS can reduce the cost of installation and maintenance in contrast with existing traffic detectors which must be stationed on the ground. But. there are Problems when GPS data is applied to the existing filtering techniques used for analyzing the data collected by other detectors. This paper proposes a method to provide users with correct traffic information through filtering abnormal data caused by the unusual driving in collected data based on GPS. We have developed an algorithm that can be applied to real-time GPS data and create more reliable traffic information, by building patterns of past data and filtering abnormal data through selection of filtering areas using Quartile values. in order to verify the proposed algorithm, we experimented with actual traffic data that include probe cars equipped with a built-in GPS receiver which ran through Gangnam Street in Seoul. As a result of these experiments, it is shown that link travel speed data obtained from this algorithm is more accurate than those obtained by existing systems.

  • PDF

Parameter Estimation & Validation of Volume-delay Function based on Traffic Survey Data (교통조사를 통한 도로통행비용함수 구축 및 검증)

  • Kim, Ju-Yeong;Chu, Sang-Ho;Gang, Min-Gu;Heo, Heon
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.1
    • /
    • pp.115-124
    • /
    • 2010
  • VDF(volume-delay function) is one of the most important factor to improve the reliability of traffic demand estimation because it is for estimation of link travel time based on the traffic volume variation. Because VDF of link except for freeway is applied as the parameter of BPR(bureau of public road) of U.S., it causes to deteriorate the accuracy of traffic demand estimation. The purpose of this paper is to establish new parameter of VDF based on the real-surveyed traffic data in order to improve the problem of the existing VDF. We suggest the reclassification of road hierarchy, the approach of traffic survey, the estimating method of VDF parameter, and the improvements of new VDF application. The new VDF allows us to estimate more realistic traffic situation in parts of demand, travel time and path between origin-destination.

A Shortest Path Algorithm Considering Directional Delays at Signalized Intersection (신호교차로에서 방향별 지체를 고려한 최적경로탐색 연구)

  • Min, Keun-Hong;Jo, Mi-Jeong;Kho, Seung-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.3
    • /
    • pp.12-19
    • /
    • 2010
  • In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

A Link Travel Time Estimation Algorithm Based on Point and Interval Detection Data over the National Highway Section (일반국도의 지점 및 구간검지기 자료의 융합을 통한 통행시간 추정 알고리즘 개발)

  • Kim, Sung-Hyun;Lim, Kang-Won;Lee, Young-Ihn
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.5 s.83
    • /
    • pp.135-146
    • /
    • 2005
  • Up to now studies on the fusion of travel time from various detectors have been conducted based on the variance raito of the intermittent data mainly collected by GPS or probe vehicles. The fusion model based on the variance ratio of intermittent data is not suitable for the license plate recognition AVIs which can deal with vast amount of data. This study was carried out to develop the fusion model based on travel time acquired from the license plate recognition AVIs and the point detectors. In order to fuse travel time acquired from the point detectors and the license plate recognition AVIs, the optimized fusion model and the proportional fusion model were developed in this study. As a result of verification, the optimized fusion model showed the superior estimation performance. The optimized fusion model is the dynamic fusion ratio estimation model on real time base, which calculates fusion weights based on real time historic data and applies them to the current time period. The results of this study are expected to be used effectively for National Highway Traffic Management System to provide traffic information in the future. However, there should be further studies on the Proper distance for the establishment of the AVIs and the license plate matching rate according to the lanes for AVIs to be established.

Finding the Time Dependent K Least Time Paths in Intermodal Transportation Networks (복합교통망에서의 동적K최소시간경로탐색)

  • Jo, Jong-Seok;Sin, Seong-Il;Im, Gang-Won;Mun, Byeong-Seop
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.5 s.91
    • /
    • pp.77-88
    • /
    • 2006
  • The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.

A Methodology for Expanding Sample OD Based on Probe Vehicle (프로브 차량 기반 표본 OD의 전수화 기법)

  • Baek, Seung-Kirl;Jeong, So-Young;Kim, Hyun-Myung;Choi, Kee-Choo
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.2
    • /
    • pp.135-145
    • /
    • 2008
  • As a fundamental input to the travel demand forecasting, OD has been always a concern in obtaining the accurate link traffic volume. Numerous methods were applied thus far without a complete success. Some existing OD estimation techniques generally extract regular samples and expand those sample into population. These methods, however, leaves some to be desired in terms of accuracy. To complement such problems, research on estimating OD using additional information such as link traffic volume as well as sample link use rate have been accomplished. In this paper, a new approach for estimating static origin-destination (OD) using probe vehicle has been proposed. More specifically, this paper tried to search an effective sample rate which varies over time and space. In a sample test network study, the traffic volume error rate of each link was set as objective function in solving the problem. As a key result the MAE (mean absolute error) between expanded OD and actual OD was identified as about 5.28%. The developed methodology could be applied with similar cases. Some limitations and future research agenda have also been discussed.

Overcoming the Braess' Paradox in Feasibility Study (경제성 분석의 브레이스 파라독스 극복 방안)

  • Park, Kyung-Chul;Ryu, Si-Kyun;Lee, Sung-Mo;Son, Sang-Hoon
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.1
    • /
    • pp.103-112
    • /
    • 2008
  • In the feasibility analysis, Braess' Paradox results in the negative social benefit in spite of adding transportation facilities. Consequently, it has been difficult to judge on the investment of SOC projects. This research aims to analyze the Braess' Paradox in the feasibility analysis and to seek a remedy for the Paradox. Several experiments were conducted on the simple network under the various conditions. From the experiments, following findings were validated: Braess' Paradox occurred only if travel demands met within certain intermediate range. In terms of traffic assignment method, the SO was more likely to reduce the effect of the Braess' Paradox than the UE. However, the Braess' Paradox in the benefit of operating cost saving occurred in all cases and the paradox in the total benefit continued. In order to solve the problem, new link cost function considered travel time and operating cost simultaneously were suggested. As a result, the negative benefit was significantly decreased in the UE case and total negative benefit was no longer shown in the SO case through the analysis.

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF

A Study on the Factors Affecting the Stopping Time and Punctuality of Bus Stop: A Case of Bus Stop by Roadside Bus Only Lane (버스 정류장 정차시간 및 정시성에 영향을 미치는 요인에 관한 연구: 가로변 버스전용차로의 정류장을 중심으로)

  • JANG, Jae-Min;LEE, Young-Inn;LEE, Keun
    • Journal of Korean Society of Transportation
    • /
    • v.35 no.3
    • /
    • pp.234-246
    • /
    • 2017
  • The Seoul metropolitan government introduced the bus information systems, bus rapid transit to increase travel speed and punctuality but still suffer from insufficiency. This paper delivers a study verifying the external factors at near the bus stops. The dependent variable was set to the standard deviation of (1) travel time and (2) travel time to and from the bus stop in this study. The independent variables were set to (1) the number of routes, (2) traffic volume by bus type, (3) the number of bus bays, (4) the possibility of passing, (5) the distance to crosswalks and intersections, and (5) the presence of residential road. The results showed that the most significant factors included the link section speed, number of bus bay, distance to crosswalk, and the possibility of passing.