• Proceedings of the KOR-KST Conference
• /
• 2003.02a
• /
• pp.127-150
• /
• 2003

This research presents a novel application of static traffic assignment methods, but with a variable time value, for estimating the market share of a high-speed rail (HSR) in the NW-SE corridor of Korea which is currently served by the airline (AR), conventional rail (CR), and highway (HWY) modes. The proposed model employs the time-space network structure to capture the interrelations among all competing transportation modes, and to reflect their supply- and demand-sides constraints as well as interactions through properly formulated link-node structures. The embedded cost function for each network link offers the flexibility for incorporating all associated factors, such as travel time and fare, in the model computation, and enables the use of a distribution rather than a constant to represent the time-value variation among all transportation mode users. To realistically capture the tripmakers' value-of-time (VOT) along the target area, a novel method for VOT calibration has been developed with aggregate demand information and key system performance data from the target area. Under the assumption that intercity tripmakers often have nearly "perfect" travel information, one can solve the market share of each mode after operations of HSR for each O-D pair under the time-dependent demand with state-of-the-art traffic assignment. Aside from estimating new market share, this paper also investigated the impacts of HSR on other existing transportation modes.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.101-107
• /
• 2008

Traffic speed data may be missed due to detector malfunction or network problems. In this paper we have proposed effective methods to estimate the data which could not be collected through loop detectors. Our proposed algorithm has three steps. First step is to find the most similar neighbor data record by coefficient of correlation. Second step is to make some data records which is calculated by the 5 kinds of estimation methods. Third step is to compare the data records with history data record of observation link and thus the best method is selected. The proposed method is useful for estimating travel time.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.83-95
• /
• 2003

This study aims to develop travel time estimation and prediction models on the freeway using measurements from vehicle detectors. In this study, we established a travel time estimation model using traffic volume which is a principle factor of traffic flow changes by reviewing existing travel time estimation techniques. As a result of goodness of fit test. in the normal traffic condition over 70km/h, RMSEP(Root Mean Square Error Proportion) from travel speed is lower than the proposed model, but the proposed model produce more reliable travel times than the other one in the congestion. Therefore in cases of congestion the model uses the method of calculating the delay time from excess link volumes from the in- and outflow and the vehicle speeds from detectors in the traffic situation at a speed of over 70km/h. We also conducted short term prediction of Kalman Filtering to forecast traffic condition and more accurate travel times using statistical model The results of evaluation showed that the lag time occurred between predicted travel time and estimated travel time but the RMSEP values of predicted travel time to observations are as 1ow as that of estimation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.617-631
• /
• 2019

In the four-step demand model, a gravity mode is used most commonly at the trip distribution stage. The purpose of this study was to develop a new friction factor that can express the accessibility property as a single friction factor to compensate for the variable limits of the gravity model parameters (travel time, travel cost). To derive a new friction factor, a new friction factor was derived using the space syntax that can quantify the characteristics of the urban space structure, deriving the link-unit integration degree and then using the travel time and travel distance relationship. Calibration of the derived friction factor resulted in a similar level to that of the existing friction factor. As a result of verifying the various indicators, the explanatory power was found to be excellent in the short - and long - distance range. Therefore, it is possible to derive and apply the new friction factor using the integration index, which can complement the accessibility beyond the limit of the existing shortest distance, and it is believed to be more advantageous in future utilization.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.19-30
• /
• 2006

This study deals with the optimized detector location considering the traffic characteristics in National Highway. Although there ave many construction works for ITS in National Highway, there is not specific criteria for detector location which can effect the accuracy of traffic information. This study. therefore. aims to Provide the optimized detector location criteria which can represent the traffic characteristics of National Highway. It collects traffic factors of study area by GPS Probe-car and defector, and Presents the optimized detector location by the correlation analysis between spot-speed and link-travel-time. The main results of this study are as followings ; First, the correlation between the spot-speed and link-travel-time Presents the opposite bell shape of the graph (U-type owe) which is increased it?on the upstream then, declined through some unspecified Point of the link. Second, the optimized detector location usually distributes around midstream of link, even though it does not have a consistency. Third, therefore, the optimized detector location generally should be located between $55{\sim}60%$ of total link length. Forth. high level of vertical slope is one of the most important factors of detector location, so it should be excluded for determination of optimized detector location. Finally, expecting that the results of this study would improve the accuracy of travel time estimation and forecasting.

• 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.13 no.4
• /
• pp.79-103
• /
• 1995

The elasticity of a model is considered most important. Without showing the proper elasticity any model cannot provide useful information for decision making. This paper demonstrates a macro model which can generate dynamic transport informations every 15 minutes. Without the Wardrop principles and the monotonicity assumptions for the link travel time and link volume relationship, the basic elements of this new modeling approache are composed of link density simulation, stochastic incremental route choice, departure time choice, destination choice and mode choice. The elasticity of the proposed model is examined based on elasticity equations and simulation results. Also the transferability from a mega city like Seoul to a big city like Daejon is demonstrated for the choice model. The issues centering around the dynamic relations among density(k), speed(u), and flow rate(v) are also discussed for the modeling of highly congested situations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.2 s.5
• /
• pp.129-140
• /
• 2004

In this paper, we conduct the research about optimal aggregation interval of travel time data on interrupted traffic flow and verify the reliability of AVI collected data by using car plate matching method in RTMS for systematic collection and analysis of link travel time data on interrupted traffic flow rural arterial. We perform Kolmosorov-Smirnov test on AVT collected sample data and on entire population data, and conclude that the sample data does not represent pure random sampling and hence includes sample collection error. We suggest that additional review is necessary to investigate the effectiveness of AVI collected sample data as link representative data. We also develop statistical model by applying two estimation techniques namely point estimation and interval estimation for calculating optimal aggregation interval. We have implemented our model and determine that point estimate is preferable over interval estimate for exactly selecting and deciding optimal aggregation interval. Our final conclusion is that 5-minute aggregation interval is optimal to estimate travel time in RTMS, as is currently being used our investigation is based on AVI data collected from Yang-ji to Yong-in $42^{nd}$ National road.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.