• Title/Summary/Keyword: 경로전환

Search Result 349, Processing Time 0.019 seconds

Analysis of Diversion Rate using Expressway Traffic Data(FTMS, TCS): Focusing on Maesong~Balan IC at Seohaean Expressway (고속도로 교통데이터(FTMS, TCS)를 이용한 경로전환율 분석: 서해안고속도로 매송~발안 구간을 중심으로)

  • Ko, Han-Geom;Choi, Yoon-Hyuk;Oh, Young-Tae;Choi, Kee-Choo
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.3
    • /
    • pp.31-41
    • /
    • 2012
  • Due to growing interests in the distribution of traffic volume through information dissemination such as VMS and traffic broadcasting system, the research on the driver's reaction and effect of the traffic report has continued. In this study, we propose a methodology, which estimates the traffic volume of diversion and the consequential diversion rate using FTMS data and TCS data, and the estimation is based on the analysis of the national highway and IC, in which real-time FTMS and TCS data are established. We also calculate the diversion rate of actual targeted sections and analyze the changes in time and spatial diversion rate. In this study, we define a deviation (considering a deviation due to dynamic properties of traffic conditions) found when the outflow traffic volume is temporarily higher than the average outflow traffic volume on a relevant time slot after providing traffic information. The diverting volume is considered to be caused by the traffic information, and the study determines the ratio of traffic volume on highways to that of route diversion as the diversion rate. The analysis on changes in the diversion rate in accordance with the time flow, the initial change in the diversion rate on upstream IC that first acquires the report on the traffic congestion is significant. After that, the change in the diversion rate on upstream IC affects the route diversion on downstream IC with spatial and time flow, and this again leads the change in upstream IC. Thereby, we confirmed that there is a feedback-control circulation system in the route diversion.

Development of a Discriminant Model for Changing Routes considering Driving Conditions and Preferred Media (주행여건과 선호매체를 고려한 경로전환 판별모형 개발)

  • Choe, Yun-Hyeok;Choe, Gi-Ju;Mun, Byeong-Seop;Go, Han-Geom
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.6
    • /
    • pp.147-158
    • /
    • 2010
  • Studies on the distribution of traffic demands have been proceeding by providing traffic information for reducing greenhouse gases and reinforcing the road's competitiveness in the transport section, however, since it is preferentially required the extensive studies on the driver's behavior changing routes and its influence factors, this study has been developed a discriminant model for changing routes considering driving conditions including traffic conditions of roads and driver's preferences for information media. It is divided into three groups depending on driving conditions in group classification with the CART analysis, which is statistically meaningful. And, elements of the driving conditions and the preferred media affecting the change of paths are classified into statistical meaningful groups through the CHAID analysis, and the major factors affecting the change of paths are examined. Finally, the extent that driving conditions and preferred media affect a route change is examined through a discriminant analysis, and it is developed a discriminant model equation to predict a route change. As a result of building the discriminant model equation, it is shown that driving conditions affect a route change much more, the entire discriminant hit ratio is derived as 64.2%, and this discriminant equation shows high discriminant ability more than a certain degree.

Modelling En-route Diversion Behavior under On-site Traffic Information (관측 교통정보를 이용한 통행중 경로전환행태 모형)

  • Kim, Hye-Ran;Chon, Kyung-Soo;Park, Chang-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.3 s.74
    • /
    • pp.137-144
    • /
    • 2004
  • The real-time traffic information is considered to be the system to alleviate traffic congestion. An effective traffic information will help drivers make efficient travel decision, and network performance will be improved. To make efficient strategy of providing information, the analyst should quantify reduced congestion by the media traffic informations. Many other route diversion models considered only media-informations as information sources and ignored the impact of on-site informations such as visible delays and average speeds, which affect drivers' route diversion decision in practice. In those models, the effect of on-site informations could be treated to be the effect of media informations, and the effects of media informations would be over-estimated. The proposed model including the impact of on-site information can estimate the effect of media-informations. The results are expected to be applied to the analysis of traffic management policy such as ITS.

유고를 고려한 고속도로 교통축의 동적통합제어모형 구축

  • 유병석;전경수
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10b
    • /
    • pp.296-296
    • /
    • 1998
  • 고속도로 교통축은 고속도로와 운전자가 대체도로로 이용할 수 있는 표면가로로 구성된 가로망을 말한다. 이러한 고속도로에서의 도로망의 효율을 극대화하기 위해서 시행되고 있는 제어기법으로는 고속도로 진입램프에서의 램프미터링과 표면가로에서의 신호시간조정 등을 들 수 있다. 그러나, 이를 통합한 제어전략은 아직 고려되고 있지 못하다. 고속도로에서 사고나 극심한 혼잡으로 인해 지체가 되었을 경우 단순히 진입램프에서 램프미터링만을 실행하는 것이 아니라 부체도로로의 경로전환을 통해 고속도로교통축의 효율을 극대화할 수 있다. 이는 지능형교통체계(ITS)에서 고려하고 있는 경로안내시스템과도 결부된다. 그러므로, 고속도로 교통축에서는 진입램프에서의 램프미터링전략과 진출램프에서의 경로전환전략, 표면가로에서의 신호최적화전략을 통한 제어를 실행할 수 있다. 따라서, 본 논문에서는 고속도로에서의 진입램프미터링과 진출램프를 통한 경로전환, 표면가로에서의 신호시간조정을 통합한 제어모형을 구축하고, 그에 따른 통합제어알고리즘을 개발하는 것을 본 논문의 목적으로 한다. 통합제어모형은 적정 제어변수의 값을 구하기 용이하게 하기 위해 선형계획법을 적용하였으며, 시뮬레이션을 통해 통합제어알고리즘을 우수성을 검증하였다.

  • PDF

Implementations of Path-Finding Algorithm using Variable Turn Heuristic (가변적인 턴 휴리스틱을 이용한 경로탐색 알고리즘의 구현)

  • Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.182-187
    • /
    • 2008
  • It needs to consider of turns during a path-finding on real road network. traveling on real road network, it generally takes less travel time in a more straight path than a zig-zaged path with same source and destination. In this paper, we propose $VTA^*$ algorithm that can reduce the cost of exploring despite increasing the number of turn in comparing with $TA^*$ algorithm. We have implement the proposed $VTA^*$, $TA^*$ which consider the number of turn and a traditional $A^*$ algorithm which dosen't consider the number of turn. The experimental result shows that the cost of exploring is reduced by 7.31 % comparing with $TA^*$ and the number of turn is reduced by 27.95% comparing with $A^*$ approximately.

  • PDF

A Development of Numerical Method for Bifurcational Bucklingof the Spatial Structures (공간구조물의 분기좌굴해석이론의 개발)

  • Lee, Kyung-Soo;Han, Sang-Eul;Lee, Jae-Young;Kim, Man-Jung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2009.04a
    • /
    • pp.496-499
    • /
    • 2009
  • 본 논문은 기하학적 비선형성을 가진 보존적 단일 하중 매개변수의 탄성 상태 공간구조의 분기이론에 관한 수치 해석적 기본 방법 및 경로 추적, pin-pointing, 경로 전환을 기술하고 있다. 비선형 탄성 불안정 상태는 극한점과 분기점으로 분류될 수 있으며, 평형경로상의 평형점의 계산 및 평형경로상의 특이점을 찾기 위한 pin-pointing 반복계산을 수행하는 일반적인 비선형 수치해석법으로 극한점을 계산할 수 있다. 그러나 분기좌굴 해석을 위해서는 좌굴 후 분기경로의 추적을 위한 분기경로 전환 알고리즘이 추가적으로 필요하다. 본문에서는 에너지이론에 기초한 일반 탄성안정이론을 소개하고, 평형경로 추적, 분기 좌굴점을 찾기 위한 직접법과 분기경로 전환에 관한 이론을 전개한다. 분기좌굴 해석예제로 트러스로 이루어진 스타돔, 핀지지의 평면아치, 평면프레임, 3차원 공간프레임의 분기좌굴 해석을 수행하여 본문에서 제시한 수치해석법의 정확성 및 실용성을 검증한다.

  • PDF

The Influence of Traffic Information based on VMS(Variable Message Sign) on the Selection of Drivers' Route (VMS(Variable Message Sign)를 통한 교통정보 제공이 운전자의 운행경로 전환에 미치는 영향 분석)

  • Jung, Hun Young;Son, Su Ran;Lee, Jeong Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.2D
    • /
    • pp.193-201
    • /
    • 2011
  • The provision of traffic information plays an important role in increasing social benefit not only by saving travel time for individuals but also by improving the efficiency of road operation. VMS(Variable Message Sign) helps on-wheel drivers easily understand the road situation, and also provides real-time traffic information to people on the streets. However, it has not been sufficiently studied on how traffic information based on VMS influences on the drivers' selection of route. This study investigated how drivers use VMS traffic information and how they are satisfied with it. Then, the model of drivers' route selection was specified with the types of traffic information and the expected travel time to examine the influence on the selection of drivers' route. The model was estimated and analyzed in three types according to the condition of detour roads, and the rate of route change and the degree of sensitivity was calculated from the estimation. The results of analysis are as follows. the $1^{st}$ type model showed the 10% of route change for the travel time saving of 5minutes, and the 81.6% of route change for the travel time saving of 20minutes. The $2^{nd}$ type led to the range of route change from 14.2% to 92.7% over the 5 through 20 minutes of travel time saving. The $3^{rd}$ model resulted in the 99.1% of route change. The sensitivity of route change showed the highest for the travel time saving of 11 minutes with the $1^{st}$ type model, 9 minutes with the $2^{nd}$ type model, and 5 minutes with the $3^{rd}$ type model respectively.

VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic (VTA* 알고리즘: 가변적인 턴 휴리스틱을 적용한 A* 경로탐색 알고리즘)

  • Kim, Ji-Soo;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.663-668
    • /
    • 2010
  • In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

A hierarchical path finding algorithm with the technique of minimizing the number of turn (방향전환 최소화 기법을 적용한 계층 경로 탐색 알고리즘)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.323-326
    • /
    • 2007
  • When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

  • PDF

Design of path-finding algorithm using dynamic turn heuristic (가변적인 턴 휴리스틱을 이용한 경로탐색 알고리즘의 설계)

  • Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.179-182
    • /
    • 2008
  • It needs to consider of turns during a path-finding on real road network. Because a car is delayed by waiting a traffic signal and decreasing speed when drived in a turn road such as cross road and slip road. If a straightness of a path is increased, a real cost of traveling should be able to decrease. An older method, the algorithm with Turn Heuristic, considered of this case. The algorithm, that differently gave weights to left, right and U-turns, improved a straightness of a path, but increased a cost of exploring. In this paper, we propose a improved Turn Heuristic Algorithm. Proposed algorithm uses Dynamic Turn Heuristic. It is able to more decrease a cost of exploring than older method by using the Turn Heuristic in a part of path-finding.

  • PDF