• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.97-108
• /
• 2001

A dynamic transportation management should be applied specially in AM peak because AM peak is more critical than PM peak in traffic volume and demand. AM peak trip can be characterized by commuting and schooling. which have the high level of usage on public transportation, and constraint on arrival time. So transportation management applied in AM peak could deal with a mode choice and an arrival time constrain. Researchers were involved in the dynamic transportation assignment models for management of congested traffic network. But, there were no models which considered a mode choice and an arrival time constrain should be included in management of AM peak. So there are limits to use exist models to control and analyze AM peak traffic. In this study, it is proposed the combined dynamic transportation model, considering a mode choice and the start time selection with arrival time constrains, based on Ran and Boyce's model. The proposed model is verified the compatibility by applying to the newly designed time space expanded network. The result shows that proposed model consistent with dynamic user optimal travel pattern. From this we certificate the applicability of the proposed model to control and analyze AM peak traffic.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.63-76
• /
• 2008

The goals of this study are to develop travel time functions based on intersection delay and to analyze the applicability of the functions to traffic assignment models. The study begins with the premise that the existing assignment models can not effectively account for intersection delay time. In pursuing the goals, this study gives particular attention to dividing the link travel time into link moving time and stopped time at node, making the models based on such variables as the travel speed, volume, geometry, and signal data of signalized intersections in Cheongju, and analyzing the applicability of these models to traffic assignment. There are several major findings. First, the study presents the revised percentage of lanes (considering type of intersection) instead of g/C for calculating intersection delay, which is analyzed to be significant in the paired t-test. Second, the assigned results of applying these models to the Cheongju network in EMME/2 are compared with the data observed from a test car survey in Cheongju. The analyses show that the BPR models do not consider the intersection delay, but the modified uniform delay model and modified Webster model are comparatively well fitted to the observed data. Finally, the assigned results of applying these models are statistically compared with the test car survey data in assigned volume, travel time, and average speed. The results show that the estimates from the divided travel time model are better fitted to observed data than those from the BPR model.

• 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.

• International Journal of Highway Engineering
• /
• v.11 no.1
• /
• pp.47-58
• /
• 2009

Calibrating toll roads of highway networks needs additional weights within volume delay functions not like other general highway lints. However, current methods assigning additional weights in the volume delay function of toll roads are not sufficiently enough to predict real toll road volumes measured, since it does not consider discounting rates and an extra charges. This study develops methods to improve relevant and reliable volume delay functions. Suggested ideas include a method of weighting volume delay functions considering a value of time of vehicle types, a method of weighting volume delay functions considering lane distributions of vehicles, and a method of weighting volume delay functions considering percentages of link lengths per a number of lanes of toll roads. It is found that the method of weighting volume delay functions considering lane distributions of vehicles show most reliable and appropriate results, while the first method shows overestimation and the third method does underestimation of highway link volumes. In terms of assignment methods, total OD equilibrium assignment shows better results than PCU based assignment.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.171-180
• /
• 1998

본 연구의 목적은 차량주행안내시스템(CNS)이 최단거리 통행노선을 제공하였을 때 운전자 노선선택 행태를 분석하는데 있다. 본 연구에서 통행목적 및 운전자 특성에 따른 운전자의 노선선택 행태를 도출한 결과, 쇼핑통행과 레저통행시 CNS에서 제공하는 노선을 선택을 하는 경우가 많은 것으로 나타났다. 또한, CNS에서 최단거리 정보를 제공했을 경우는 운전자 특성에 따라 노선선택행태가 차이가 있으며 통행목적별로 노선선택에 영향을 미치는 운전자 특성이 달라지는 것으로 분석되었다. 본 연구의 분석을 통하여 통행목적 및 운전자 특성에 따른 운전자의노선선택 행태를 도출해 운전자 특성과 통행특성에 따른 노선선택 행태를 반영한 통행배정모형을 구출할 수 있을 것으로 기대된다.

• Proceedings of the KOR-KST Conference
• /
• 1997.12a
• /
• pp.89-119
• /
• 1997

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.65-72
• /
• 2000

Travel demand forecasting is the important process of transportation policy and planning, especially trip assignment is also important because it finds deficiency of network GIS can be applied to transportation due to its various merits. Recently Program development environment is changed to component-based and transportation-component is necessary. This study evolves in implementing trip assignment model with GIS and tries to apply the system to the Cheongju City.

• 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.