• Title/Summary/Keyword: 통행지체함수

Search Result 16, Processing Time 0.026 seconds

Development of Classified Congestion Functions (도로유형별 지체함수 정립에 관한 연구)

  • 강호익;박창호
    • Journal of Korean Society of Transportation
    • /
    • v.16 no.2
    • /
    • pp.117-131
    • /
    • 1998
  • 지체함수는 교통량과 속도의 관계를 단조 증가함수로 단순화하여 교통수요예측의 교통배정모형에 사용되게 된다. 이 지체함수를 구하는 방법은 두가지로 구분할 수 있는데, 첫째는 교통배정을 통해 구해지는 추정 링크통행량과 실측 교통량을 비교해 가면서 정산하는 방법이고 둘째는 교통량-속도 관계로부터 직접 구하는 방법이다. 첫째 방법은 구해진 O/D 통행량표의 부정확성과 모형에 내재하는 오류가 이 지체함수에 포함될 가능성이 매우 높은 단점을 가지고 있다. 본 연구에서는 교통량-속도 관계로부터 직접 도로유형별 지체함수를 구하여 교통배정에 적용하는 새로운 방법을 정입하였다. 교통망 전체에 대하여 단일 지체함수를 적용하는 기존의 방법은, 교통량 변화에 따른 통행시 간의 변화가 보다 둔감한 고급도로에 변화는 고급도로일수록 둔감하게 나타나며, 교통배정에 도로유형별 지체함수를 적용할 경우 단일 지체함수 적용시에 비하여 고급도로에 더 많은 교통량이 배정되게 된다. 본 연구의 결과, 교통망상에서 보다 현실적인 도로유형별 분담을 이룰 수 있는 방안이 정립됨으로써, 지금까지 교통배정에 있어 상대적으로 과소평가되어 왔던 고속도? 등 고급도로의 실제 타당성을 반영할 수 있게 되어 도로의 기능적 배차구조가 확립된 효율적인 교통망을 구성할 수 있는 계기를 마련한 것으로 판단된다.

  • PDF

A Volume-Delay Function Parameter Estimation and Validation for Traffic Assignment (도로 통행지체함수의 파라미터 추정 및 검증)

  • Lim, Yong-Taek;Kang, Min-Gu;Choo, Sang-Ho;Lee, Sang-Min
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.17-29
    • /
    • 2008
  • A volume-delay function(VDF) has been used to describe the relation between traffic volumes and delay experienced by travelers on the roads traveling from origin to destination, which has been usually adopted in traffic assignment. For the purpose of more precise description of traffic pattern, we have to estimate the parameters of VDF in advance. This paper presents a methodology for estimating the parameters, which combined with golden section method. By using the method we have estimated the parameters with real data based on KTDB(2006), and validated them. Compared to the existing values of the parameters, newly estimated values are found to be closer to real world.

포준지체식 파라메터 조정을 통한 동적 통행배정모형에서 링크성능함수의 최적화에 관한 연구

  • 김욱경
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10a
    • /
    • pp.41-41
    • /
    • 1998
  • ITS틀 내의 한 분야인 도로교통정보체계 (ATIS: Advanced Traveler Information system)는 실시간 교통정보를 운전자에게 직접 제공하는 것으로서, 이를 위해 매 순간마다 가로망에 배정되는 교통량 및 통행시간을 예측할 수 있는 범용의 동적 통행배정모형(dynamic route choice model)의 개발이 필히 수반되어야 한다. 본 연구에서는 ITS사업에서 필수적으로 수반되어야 할 최적 제어이론에 의한 동적 통행 배정모형을 ATIS의 핵심 소프트웨어로 응용하기 위해 기존 연구성과를 발판으로, 순간 동적 통행 배정모형(Ran, Boyce &LeBlanc, 1993)의 통행제약조건인 링크통행함수, 특히, 과부하 시 엘켈릭의 일반식의 파라메터를 조정, 적용하여, 서울시 강남지역의 실제 가로망의 사례연구를 통해 지체식의 각각의 파라메터에 따른 결과를 O/D에 따른 통행시간, 링크통행시간, 혼잡도를 중심으로 비교 평가하여, ATIS의 핵심 소프트웨어로서 순간 동적 통행배정을 통해 보다 현실여건을 잘 반영할 수 있는 링크 통행 성능 함수를 도출하였다.

  • PDF

Development of Travel Time Functions Considering Intersection Delay (교차로 지체를 고려한 통행시간함수 개발)

  • Oh, Sang-Jin;Park, Sang-Hyuk;Park, Byung-Ho
    • 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.

Basic Studies on Development of Turn Penalty Functions in Signalized Intersections (신호교차로의 회전제약함수 개발을 위한 기초연구)

  • O, Sang-Jin;Kim, Tae-Yeong;Park, Byeong-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.157-167
    • /
    • 2009
  • This study deals with the turn penalty functions in the urban transportation demand forecasting. The objectives are to develop the penalty functions of left-turn traffic in the case of signalized intersections, and to analyze the applicability of the functions to the traffic assignment models. This is based on the background that the existing models can not effectively account for the delays of left-turn traffic which is bigger than that of through traffic. In pursuing the above, this study gives particular attention to developing the penalty functions based on the degrees of saturation by simulation results of Transyt-7F, and analyzing the applicability of the functions by the case study of Cheongju. The major findings are the followings. First, two penalty functions developed according to the degrees of saturation, are evaluated to be all statistically significant. Second, the results that the above functions apply to the Cheongju network, are analyzed to be converging, though the iteration numbers increase. Third, the link volumes forecasted by turn penalty functions are evaluated to be better fitted to the observed data than those by the existing models. Finally, the differences of traffic volumes assigned by two functions, which are exponential and divided forms, are analyzed to be very small.

A Methodology of Path based User Equilibrium Assignment in the Signalized Urban Road Networks (도시부 도로 네트워크에서 교통신호제어와 결합된 경로기반 통행배정 모형 연구)

  • Han, Dong-Hee;Park, Jun-Hwan;Lee, Young-Ihn;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.2
    • /
    • pp.89-100
    • /
    • 2008
  • In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

Application and Evaluation of a Traffic Signal Control Algorithm based on Travel Time Information for Coordinated Arterials (연동교차로를 위한 통행시간기반 신호제어 알고리즘의 현장 적용 및 평가)

  • Jeong, Yeong-Je;Kim, Yeong-Chan
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.5
    • /
    • pp.179-187
    • /
    • 2009
  • This study develops a real-time signal control algorithm based on sectional travel times and includes a field test and evaluation. The objective function of the signal control algorithm is the equalization of delay of traffic movements, and the main process is calculating dissolved time of the queue and delay using the sectional travel time and detection time of individual vehicles. Then this algorithm calculates the delay variation and a targeted red time and calculates the length of the cycle and phase. A progression factor from the US HCM was applied as a method to consider the effect of coordinating the delay calculation, and this algorithm uses the average delay and detection time of probe vehicles, which were collected during the accumulated cycle for a stabile signal control. As a result of the field test and evaluation through the application of the traffic signal control algorithm on four consecutive intersections at 400m intervals, reduction of delay and an equalization effect of delay against TOD control were confirmed using the standard deviation of delay by traffic movements. This study was conducted to develop a real-time traffic signal control algorithm based on sectional travel time, using general-purpose traffic information detectors. With the current practice of disseminating ubiquitous technology, the aim of this study was a fundamental change of the traffic signal control method.

Level of Service of Signalized Intersections Considering both Delay and Accidents (지체와 사고를 고려한 신호교차로 서비스수준 산정에 관한 연구)

  • Park, Je-Jin;Park, Seong-Yong;Ha, Tae-Jun
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.169-178
    • /
    • 2008
  • Level of Service (LOS) is one of ways to evaluate operational conditions. It is very important factor in evaluation especially for the facility of highways. However, some studies proved that ${\upsilon}/c$ ratio and accident rate is appeared like a second function which has a U-form. It means there is a gap between LOS and safety of highway facilities. Therefore, this study presents a method for evaluation of a signalized intersection which is considered both smooth traffic operation (delay) and traffic safety (accident). Firstly, as a result of our research, accident rates and EPDO are decreased when it has a big delay. In that reason, it is necessary to make a new Level of Service included traffic safety. Secondly, this study has developed a negative binominal regression model which is based on the relation between accident patterns and stream. Thirdly, standards of LOS are presented which is originated from calculation between annual delay costs and annual accident cost at each intersection. Lastly, worksheet form is presented as an expression to an estimation step of a signalized intersection with traffic accident prediction model and new LOS.

Calibration of a Network Link Travel Cost Function with the Harmony Search Algorithm (화음탐색법을 이용한 교통망 링크 통행비용함수 정산기법 개발)

  • Kim, Hyun Myung;Hwang, Yong Hwan;Yang, In Chul
    • 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.

Search for an Optimal-Path Considering Various Attributes (다양한 경로속성을 고려한 최적경로 탐색)

  • Hahn, Jin-Seok;Chon, Kyung-Soo
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.1
    • /
    • pp.145-153
    • /
    • 2008
  • Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.