• 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.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• Journal of Korean Society for Geospatial Information Science
• /
• v.12 no.1 s.28
• /
• pp.11-20
• /
• 2004

The purpose of this paper is to evaluate the applicability of GPS data for real-time traffic information collection especially after SA removal. Two major results have been reported. One is the GPS data availability and/or useful data point density for travel time estimation using Circle-X algorithm. 87.23% of data points can be mobilized after SA whereas only 29.94% of data was useful in calculating travel time. The other is the possible reduction of the buffer size that is used for screening the points of all GPS into useful and useless data, respectively. With these outcomes, it is safely expected that the regular GPS alone can provide the data points for real-time travel time estimation instead of the more expensive DGPS system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.39-57
• /
• 2018

The purpose of this study was to construct an artificial intelligence model that learns and estimates the relationship between vehicle queue length and link travel time in urban areas. The vehicle queue length estimation model is modeled by three models. First of all, classify whether vehicle queue is a link overflow and estimate the vehicle queue length in the link overflow and non-overflow situations. Deep learning model is implemented as Tensorflow. All models are based DNN structure, and network structure which shows minimum error after learning and testing is selected by diversifying hidden layer and node number. The accuracy of the vehicle queue link overflow classification model was 98%, and the error of the vehicle queue estimation model in case of non-overflow and overflow situation was less than 15% and less than 5%, respectively. The average error per link was about 12%. Compared with the detecting data-based method, the error was reduced by about 39%.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.3
• /
• pp.1-14
• /
• 2008

Mass transit information should contribute many benefits to users. Especially transportation information technology is developing highly with information technology in Korea recently. Hereafter it is expected to provide customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithms in public transportation networks including travel and transfer attributes. In this research, multi objectives such as travel time, transfer time, and number of transfer and so on are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding alternatives arbitrarily is proposed by selecting the best alternative which provides maximum utility to users among non dominated paths. Therefore, the ultimate goal of this study proposes a multi objective shortest paths finding algorithm which can take into account multiple user classes in a transit network with multiple travel modes. The proposed algorithm is demonstrated based on the two case studies - a small toy network and the large-scaled Seoul Metropolitan subway network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.5
• /
• pp.1525-1534
• /
• 2014

In recent years, the passengers are likely to decide their route on impulse due to the development of the integrated public transport system, and real-time information system. Especially, public transport fare integration in Seoul Metropolitan area, 2004 makes them not to have resistance about changing the modes or routes and their route choice is most effected by the degree of congestion. Assignment model have limitations to describe route changes by congestion. In this study, the concept of a link cost function used in road assignment and Effective frequency is introduced to describe the passengers' behavior when the capacity of public transport is over and the waiting time variation. Two situations, new transit line operation and accident, are set up to validate the model, as a result of the transit assignment by this model, the traffic on networks is not over the capacity. It is expected that this study will be of help to reflect the various behaviors in transit assignments.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.83-97
• /
• 2000

The traffic management schemes through traffic signal control and information provision could be effective when the link-level data and trip-level data were used simultaneously in analysis Procedures. But, because the trip-level data. such as origin, destination and departure time, can not be obtained through the existing surveillance systems directly. It is needed to estimate it using the link-level data which can be obtained easily. Therefore the objective of this study is to develop the model to estimate O-D demand using only the link flows in highway network as a real time. The methodological approaches in this study are kalman filer, least-square method and normalized least-square method. The kalman filter is developed in the basis of the bayesian update. The normalized least-square method is developed in the basis of the least-square method and the natural constraint equation. These three models were experimented using two kinds of simulated data. The one has two abrupt changing Patterns in traffic flow rates The other is a 24 hours data that has three Peak times in a day Among these models, kalman filer has Produced more accurate and adaptive results than others. Therefore it is seemed that this model could be used in traffic demand management. control, travel time forecasting and dynamic assignment, and so forth.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.77-88
• /
• 2003

This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.

• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.149-149
• /
• 1998

차종구분의 필요성은 교통공학 및 계획분야에서 교통패턴을 파악할 필요가 있으며 도로의 포장설계와 같은 구조적 측면, 교통관련자료구축 등에서도 중요하다. 현재 국내에서 운영중에 있는 각종검지기 체계들은 외국에서 개발한 체계로서 여러 가지 다양한 센서를 복합구성하여 차종을 구분하는 고가의 장비들이다. 이에 대한 국내의 연구사례는 극히 드물다고 볼 수 있다. 지금까지 주를 이룬 국내 연구사례를 보면 루프검지기를 이용한 차종구분이 주를 이루고 있다. 현재 루프검지기의 대체검지기(영상검지기, 자석검지기)개발이 활발히 진행되고 있으며 본 연구에서 이용되는 검지기는 자석검지기로서 루프검지기에 비하여 설치가 간단하고 파손의 우려가 적으며 유지관리 및 보수가 손쉽고 비용면에서도 저렴하다는 것이 장점이라 하겠다. 이에 최근에 개발되어진 단일 자석검지기를 이용한 실시간 차종인식 알고리즘을 개발하고, 현장실험을 통한 현장 적용성을 검토한다. 고속도로에 설치되어 있는 자석검지기를 이용하여 자료를 수집하며 분석에 이용되는 자료는 개별차량에 대하여 자속밀도의 변화를 주파수값으로 변환한 Digital Data값이다. 그 수치를 토대로 각 차량의 점유시간을 파악하여 각 차량의 점유시간동안 파형의 특징을 추출하여 각 특징들을 기초로 하여 각 차량이 나타내는 고유의 파형을 식별하는 패턴인식 방법으로 접근한다. 본 연구에서는 검지기 매설장소의 유한성 및 연구대상 도로의 특성으로 인하여 다양한 차종의 자료수집이 용이하지 못하여 시험가능한 자료수가 많은 차종을 대상으로 분석한다. 차종인식 알고리즘상의 차종분류는 건설교통부 차종분류기준에 따라 우선 구분이 확실한 차종으로 나눈후 단계적으로 세부적 차종분류로 접근한다.의 영향들을 고려함으로써 가로망 설계 과정에서 가로망의 상반된 역할인 이동성과 접근성의 비교가 가능한 보다 현실적인 가로망 설계 모형을 구축하고자 한다. 지금까지 소개된 가로망 설계모형들은 용량변화에 대한 설계변수의 형태에 따라 이산적 가로망 설계 모형과 연속적 가로망 설계모형으로 나뉘어지게 된다. 본 논문의 경우, 계산속도의 향상 측면에서는 연속적 가로망 설계 모형을 도입할 수 있지만, 이때 요구되는 도로용량이 이산적인 변수(차선 수)로 결정되어야만 신호제어 변수를 결정할 수 있기 때문에, 이산적 가로망 설계 모형이 사용된다. 하지만, 이산적 설계모형의 경우 조합최적화 문제이므로 정확한 최적해를 구하기 위해서는 상당한 시간이 소요되며, 경우에 따라서는 국부 최적해에 빠지게 된다. 이러한 문제를 극복하기 위해, 우선 이상적 모형의 근사화, 혹은 조합최적화문제를 위해 개발된 Simulated Annealing기법의 적용, 연속적 모형의 변수를 이산화하는 방법 등 다양한 모형들을 고려해 본 뒤, 적절한 모형을 적용할 것이다. 가로망 설계 모형에서 신호제어를 고려하기 위해서는 주어진 가로망에 대한 통행 배정과정에서 고려되는 통행시간을 링크통행시간과 교차로 지체시간을 동시에 고려해야 하는데, 이러한 문제의 해결을 위해서 최근 활발히 논의되고 있는 교차로에서의 신호제어에 대응하는 통행배정 모형을 도입하여 고려하고자 한다. 이를 위해서 지금까지 연구되어온 Global Solution Approach와 Iterative Approach를 비교, 검토한 뒤 모형에 보다 알맞은 방법을 선택한다. 차량의 교차로 통행을 고려하는 performance function의 경우 비신호 교차로와 신호교차로에 대

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.