• Title/Summary/Keyword: 링크통행속도

Search Result 69, Processing Time 0.025 seconds

A Path-based Traffic Flow Simulation Model for Large Scale Network (기종점 기반 대규모 가로망 교통류 시뮬레이션 모형)

  • 조중래;홍영석;손영태
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.3
    • /
    • pp.115-131
    • /
    • 2001
  • The Purpose of this study is to develop a simulation model for large-scale network with interrupted flow as well as uninterrupted flow. The Cell Transmission(CT) theory is used to simulate traffic flow. Flow transition rules have been newly developed to simulate traffic flows at merging and diverging sections, and signalized intersections. In the model, it is assumed that dynamic OD table is exogenously given. Simulation results for toy network shows that the model can explain queue dynamics not only in signalized intersections of urban arterials, but also in merging and diverging sections of freeway. In case study, the model successfully simulated traffic flows of 145,000 vehicles on CBD network of city of Seoul with 74 traffic zones, 133 signalized intersections among 395 nodes and 1110 links.

  • PDF

The Quartile Deviation and the Control Chart Model of Improvement Confidence for Link Travel Speed from GPS Probe Data (사분위편차 및 관리도 모형에 의한 GPS 수집기반 구간통행속도 데이터 이상치 제거방안 연구)

  • Han, Won-Sub;Kim, Dong-Hyo;Hyun, Cheol-Seung;Lee, Ho-Won;Oh, Yong-Tae;Lee, Choul-Ki
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.21-30
    • /
    • 2008
  • The travel speed collected by the prove-car equipped with the GPS has the problems, which are the data's stability and finding out the representative travel speed, by the influence of the traffic signal and etc. at the interrupted traffic. This study was conducted to develop the method of filtering the outlier data from the data collected by the prove-car. The method to remove the outlier data from the serial data which were collected by the prove-car was adapted to each of the quartile deviation statistics model and the management graphic statistics model. The rate of removing the outlier data by the quartile deviation method was $0{\sim}3.7%$ while the rate by the management graphic statistic methods was $0.3{\sim}7.2%$. Both methods show the low removal rate at the dawn time when the traffic is inactivity, on the other hand the remove rate is high during the daytime. However, both methods have the problem such that the threshold level for removing the outlier data was established at the low bound in the case as good as the statistics model. Therefore, it is required for the experience calibration.

  • PDF

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks (도시부 가로망에서의 링크 통행속도 기반 One-to-One 최단시간 경로탐색 알고리즘 개발)

  • Kim, Taehyeong;Kim, Taehyung;Park, Bum-Jin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.5
    • /
    • pp.38-45
    • /
    • 2012
  • Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

A Study on the Preemption Control Strategies Considering Queue Length Constraints (대기행렬길이 제약조건을 고려한 Preemption 제어 전략에 관한 연구)

  • Lee, Jae-Hyeong;Lee, Sang-Su;O, Yeong-Tae
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.2
    • /
    • pp.179-187
    • /
    • 2009
  • Currently, the signalized intersections in Korea are operated without providing an emergency vehicle preemption control strategy. Thus, it might threaten the safety of the pedestrians and drivers on highways when an emergency vehicle faces congested traffic conditions. The existing preemption control is activated when an emergency vehicle is detected along a path. This enables emergency vehicles to progress uninterrupted, but it also increases the delay of other vehicles. In this paper, a revised preemption control strategy considering queue length restrictions is proposed to make both a progressive movement of an emergency vehicle and reduce delay of other vehicles simultaneously. By applying the preemption control strategy through a simulation study, it was shown that delay of an emergency vehicle decreased to 44.3%-96.1% and speed increased to 8.8%-42.0% in all 9 cases as compared with a conventional signal control. The existing preemption control is superior for oversaturated conditions (v/c >1.0) or a link length less than 200m. However, the preemption control considering queue length constraints shows better performance than the existing preemption control when the v/c is less than 0.8 and a link length is longer than 500m.

Development of a Vehicle Classification Algorithm Using an Micro-Cell Detector on a Freeway (자석식 검지기를 이용한 차종인식 알고리즘 개발)

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

  • PDF

Measuring the Connectivity of Nodes in Road Networks (도로 네트워크의 노드 연계성 산정에 관한 연구)

  • Park, Jun-Sik;Gang, Seong-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.4
    • /
    • pp.129-139
    • /
    • 2010
  • This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

Lane-wise Travel Speed Characteristics Analysis in Uninterrupted Flow Considering Lane-wise Speed Reversal (차로속도역전현상을 고려한 연속류 도로의 차로별 주행 속도 특성 분석)

  • Yang, Inchul;Jeon, Woo Hoon;Ki, Sung hwan;Yoon, Jungeun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.6
    • /
    • pp.116-126
    • /
    • 2016
  • In this study, lane-wise traffic flow characteristics were analysed on uninterrupted flow using a new notion of "lane-wise travel speed reversal (LTSR)" which is defined as a phenomena that travel speed in the median lane is lower than other lanes. Mathematical formulation was also proposed to calculate the strength of LTSR. The experiment road site is Seoul Outer Ring Expressway (Jayuro-IC~Jangsoo-IC), and travel trajectories for each four lane were collected for weekdays (Mon. through Fri.) during morning peak. Comparing lane-wise travel speeds for entire test road section, no LTSR was observed, meaning that the travel speed in the median lane is the fastest, followed by 2nd, 3rd, and 4th lane as in order. Howerver, the result of microscopic analysis using 100-meter discrete road section based data shows that LTSR occurs many times. Especially the strength of LTSR is higher in congestion area and freeway merge and diverge segment. It is expected that these results could be used as a fundamental data when establishing lane-by-lane traffic operation strategy and developing lane-wise traffic information collection and dissemination technology.

The Development of Estimation Technique of Freeway Origin-Destination Demand Using a Real Traffic Data of FTMS (교통관리시스템의 실시간 교통자료를 이용한 고속도로 동적OD 추정기법의 개발)

  • Kim, Ju-Young;Lee, Seung-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.4 s.82
    • /
    • pp.57-69
    • /
    • 2005
  • The goal of this paper is to develop freeway Origin-Destination (OD) demand estimation model using real-time traffic data collected from Freeway Traffic Management System (FTMS). In existing research, the micro-simulation models had been used to get a link distribution proportion by time process. Because of hi-level problem between the traffic flow model and the optimal OD solution algorithm, it is difficult for the existing models to be loaded at FTMS. The formulation of methodology proposed in this paper includes traffic flow technique to be able to remove the bi-level problem and optimal solution algorithm using a genetic algorithm. The proposed methodology is evaluated by using the real-time data of SOHAEAN freeway, South Korea.

Dynamic Origin-Destination Demand Estimation Using Traffic Data of VDS and AVI (VDS 및 AVI 자료를 이용한 고속도로 동적OD 추정)

  • Kim, Ju-Young;Lee, Seung-Jae;Lee, Young-Ihn;Son, Bong-Soo
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.125-136
    • /
    • 2005
  • The goal of this paper is to develop freeway Origin-Destination (OD) demand estimation model using VDS and AVI data. The formulation of methodology proposed in this paper includes traffic flow technique to be able to remove the bi-level problem and optimal solution algorithm using a kalman filter algorithm. The proposed dynamic OD estimation model use ilk and off-ramp volumes collected from VDS and partial OD collected from AVI data to raise the accuracy of dynamic OD estimation. The proposed model is evaluated by using the real-time data of SOHAEAN freeway, South Korea. The result of the proposed dynamic OD estimation model based on VDS and AVI data is better than that of based on VDS data. The more AVI systems are equipped at on and off-ramp, the more excellent result of estimation accuracy is expected.

Bicyclists' Behavioral Characteristics and Impacts on Route Choice Using Stated Preference Survey in Commuting Time (통근시간대 자전거이용자의 이용행태특성 및 경로선택 영향요인 분석)

  • Lee, Jae-Yeong
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.5
    • /
    • pp.77-87
    • /
    • 2010
  • In the last five years, Korea has supplied many more bicycle facilities than in the last several decades combined. However, have bicyclists increased in proportion to investment? If bicyclists are avoiding existing bicycle related facilities, including off-road bicycle facilities, it could be because suppliers did not consider bicyclists' preferences in their planning process. In this paper, the authors tried to understand the bicyclists' behavioral and route choice characteristics using stated preference surveys and a logit model, using commuting time in Daejeon Metropolitan City, Korea. The results show that nine factors affect the route choice behavior of bicyclists. In particular, bicyclists preferred sub-arterial roads to off-road, dedicated bicycle facilities in residential area. It means that bicyclists like a seamless bicycle route and that a buffer zone between car lanes and bicycle lanes or 50 km/h speed limits for cars are necessary for bicycle lanes that are not physical separated.