• 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.22 no.7 s.78
• /
• pp.99-106
• /
• 2004

This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.41-52
• /
• 2000

In the developing country, the transportation situation is changed very quickly and the transportation environment is not stable. So the transportation planning should be frequently made in considering the limited cost and time. And the traditional large-scale survey(household survey, roadside interview, etc.) has many Problem like the difficulty for doing it and getting mood results. Therefore the study about the method of evaluation on the traffic count based O/D matrix is Processing actively recently. Though the many study for the network in the realistic size are enacted, the study for comparing with the advantage and disadvantage of each method are few. Therefore this study mainly deals with the static method among the existing models of evaluation on the traffic count based O/D matrix(in terms of the transportation plan). Bi-level(GU) and gradient method are selected as main alternative model and analyzed their capability and validity. For testing the reliability of the models, Bi-level(GLS) and gradient method are adapted to toy network. Then we analyze the result of testing, and study the way for large network.

• Korean Journal of Remote Sensing
• /
• v.38 no.1
• /
• pp.1-20
• /
• 2022

As unmanned aerial vehicle (UAV) technology grew in popularity over the years, it was introduced for air quality monitoring. This can easily be used to estimate the sidewalk emission concentration by calculating road traffic emission factors of different vehicle types. These calculations require a simulation of the spread of pollutants from one or more sources given for estimation. For this purpose, a Gaussian plume dispersion model was developed based on the US EPA Motor Vehicle Emissions Simulator (MOVES), which provides an accurate estimate of fuel consumption and pollutant emissions from vehicles under a wide range of user-defined conditions. This paper describes a methodology for estimating emission concentration on the sidewalk emitted by different types of vehicles. This line source considers vehicle parameters, wind speed and direction, and pollutant concentration using a UAV equipped with a monocular camera. All were sampled over an hourly interval. In this article, the YOLOv5 deep learning model is developed, vehicle tracking is used through Deep SORT (Simple Online and Realtime Tracking), vehicle localization using a homography transformation matrix to locate each vehicle and calculate the parameters of speed and acceleration, and ultimately a Gaussian plume dispersion model was developed to estimate the CO, NOx concentrations at a sidewalk point. The results demonstrate that these estimated pollutants values are good to give a fast and reasonable indication for any near road receptor point using a cheap UAV without installing air monitoring stations along the road.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.89-99
• /
• 2000

To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.

• Journal of the Korean housing association
• /
• v.17 no.3
• /
• pp.61-69
• /
• 2006

Vertical vibrations on the slab of buildings are affected by types of vibration sources, transfer paths, and the material property and the size of members. Among these parameters, the vibration sources and the transfer path can not be controlled, but the property and the size of members can be controlled in the phase of design the members. In this study, the vibration responses according to the property and size of members were obtained by using a prediction program based on dynamic-stiffness matrix. Three parameters which are not usually considered as major factors for architecral planning were selected fur these analyses. They are the strength of materials, the thickness of wall and the thickness of slab. The ground vibration source located near a building was used as vibration input data in the analyses. This study has its originality on presenting appropriate property and size of structural members in order to reduce vertical vibration of slab in shear-wall structures. Analysing the results from the vibration estimation program according to the variations of parameters, the appropriate ratio among the sizes of structural members were proposed. From these results, the vibration level on the slab which is not constructed yet would be predicted and the vibration peak level can be reduced or shifted into the desirable frequency range. Therefore, the vertical vibration could be controlled in the phase of designing buildings.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1549-1556
• /
• 2016

By increased moving speed of aircraft, estimating location of itself becomes more important than ever. This requirement is satisfied by appearance of GPS, however it is useless when signal reception from satellite is not good enough by interruption, for example, traffic jamming. Applying link for communication to additional positioning system is capable of providing relative position of aircraft. Estimating location with link for communication is done without additional equipment but with signal processing based on correlation of received signal. ESPRIT is one of the representative algorithm among them. Estimating correlation matrix is possible to have error since it includes average operation needs enough number of samples not impractical. Therefore we propose algorithm that defines, estimates and removes error matrix of correlation. Proposing algorithm shows better performance than previous one when transmitters are close.

• Journal of Korean Society of Transportation
• /
• v.19 no.2
• /
• pp.61-72
• /
• 2001

기존의 링크교통량으로부터 OD추정모형은 기존 OD에 대한 추정의 종속성이 커, 기존 OD나 관측링크교통량의 오차에 따라 추정결과가 일관적이지 않은 문제점을 가지고 있다. 또한 관측링크교통량의 정확도가 중요함에도 불구하고 차종구분 없이 링크교통량을 이용하여 정보의 손실을 초래하였고 결과적으로 OD 추정력을 저하시켰다. 그렇지만 다차종 링크교통량으로부터 다차종 OD를 구하는 연구는 거의 없었으며, 그 추정결과가 단일차종에 대한 추정결과와 어떻게 다른지에 대한 연구도 전무하였다. 본 연구의 목적은 기존의 OD 추정모형이 기존 OD에 대해 종속성을 가지며 차종구분 없이 모형을 구성함으로써 추정력의 저하를 초래하였음을 밝히고, 이에 대한 대안으로 종속성 문제를 완화하고 차종구분을 통해 OD 추정모형의 추정력을 증진시키자 하는 것이다. 이를 위해 유전알고리즘을 이용한 다차종 OD행렬 추정모형(GAMUC)을 구축하고, 이를 기존의 바이레벨 모형의 IEA 알고리즘 및 다차종으로 확장한 모형(IEAMUC)과 게임이론측면에서 검토하였으며, 사례네트워크에 대해 각 기법을 비교하였다. 본 연구는 유전알고리즘을 이용한 OD 추정기법을 축도로에 적용한 임용택 등(2000)과 이를 네트워크로 확장한 백승걸 등(2000)의 연구를 다차종으로 확장한 것이다. 사례분석 결과 기존 OD의 오차변화나 관측링크교통량의 오차변화 등에 있어 GAMUC가 IEA나 IEAMUC보다 추정력이 양호하여, 실제 OD를 알 수 없는 도시부 네트워크에서 GAMUC 모형의 적용력이 우수하였다. 또한 차종을 구분하지 않은 기존 모형은 실제 OD와는 전혀 다른 OD 구조를 도출할 수 있음을 보였으며, 단일 차종을 여러 차종으로 구분하여 OD를 추정하는 것이 더 양호한 추정력을 확보하는 것으로 나타났다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.31-44
• /
• 2004

The study of Estimation model for the short-term travel time prediction. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Before providing a dynamic shortest path finding, the prediction model should be verified. To verify the prediction model, three models such as Kalman filtering, Stochastic Process, ARIMA. The ARIMA model should adjust optimal parameters according to the traffic conditions. It requires a frequent adjustment process of finding optimal parameters. As a result of these characteristics, It is difficult to use the ARIMA model as a prediction. Kalman Filtering model has a distinguished prediction capability. It is due to the modification of travel time predictive errors in the gaining matrix. As a result of these characteristics, the Kalman Filtering model is likely to have a non-accumulative errors in prediction. Stochastic Process model uses the historical patterns of travel time conditions on links. It if favorably comparable with the other models in the sense of the recurrent travel time condition prediction. As a result, for the travel time estimation, Kalman filtering model is the better estimation model for the short-term estimation, stochastic process is the better for the long-term estimation.