• Title/Summary/Keyword: u-turn

Search Result 221, Processing Time 0.019 seconds

A Study on Installation of U-Turn Lane for Efficient Operation of Left Turn at Signalized Intersections (신호교차로 좌회전 효율적 처리를 위한 유턴차로 설치방법 연구)

  • Park, Chahgwha;Yoon, Byoungjo;Kang, Bongsuk
    • Journal of the Society of Disaster Information
    • /
    • v.11 no.4
    • /
    • pp.597-606
    • /
    • 2015
  • Until now, u-turn lane installation methods have been studied variously. But, There is no specific standard yet. This study ranges are commercial area in Incheon metropolitan city through field investigation and presents specific design standard for efficient operation of left turn using a field data through calculating relevant permitted u-turn lane length and minimum separation distance from the front intersection to starting point of permitted u-turn lane in urban signalized intersections in commercial area. Relevant permitted u-turn lane length is found to be 32m and minimum separation distances from the front intersection to starting point of permitted u-turn lanes are 72m, 40m, 24m in case of 1 left turn lane, 2 left turn lanes and 3 left turn lanes respectively. By comparing result values and field data, they had a large difference under the similar situations in their lengths. This result is caused of no specific standard about design of u-turn lanes. If results of this study applied to design of u-turn lanes, signalized intersections in urban commercial areas would be operated more safety and efficiently.

A Study on the Socio-economic Effects of U-turn Migration in Rural Area (귀농(歸農)이 농촌사회(農村社會)에 미치는 영향(影響)에 관한 연구(硏究))

  • Kim, Jai-Hong
    • Korean Journal of Agricultural Science
    • /
    • v.25 no.1
    • /
    • pp.138-147
    • /
    • 1998
  • U-turn migration is one of the prominent phenomenon after IMF controlled Korean economy. However a number of U-turn migrants were settled in rural area before that time. This paper is aims at studying the socio-economic effects of U-turn migration in rural area. The study results are summarized as follows; First, migrants are relatively young and engaged in overall parts of the farming. The farmer with age under 50 is represented at 71.4% of migrants comparing with 53.7% of those farmers in rural area. Second, owing to the increasing number of U-turn migrants, the decreasing price of rural wages, the decreasing of idle land, and the increasing price of farm land are the outstanding phenomenon at present. Third, even though there are many kinds of supporting systems for U-turn migrants, the systems are not so successfully functioned. For the successful supporting system they must be changed for the individual migrant rather than target group.

  • PDF

Development of the U-turn Accident Model at Signalized Intersections in Urban Areas by Logistic Regression Analysis (로지스틱 회귀분석에 의한 도시부 신호교차로 유턴 사고모형 개발)

  • Kang, Jong Ho;Kim, Kyung Whan;Kim, Seong Mun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.34 no.4
    • /
    • pp.1279-1287
    • /
    • 2014
  • The purpose of this study is to develop the U-turn accident model at signalized intersections in urban areas. The characteristics of the accidents which are associated with U-turn operation at 3 and 4-legged signalized intersections was analyzed and the U-turn accident model was developed by regression analysis in Changwon city. First, in order to analyze the effectiveness on traffic accidents by U-turn installation, the difference of mean of traffic accident number are measured between two groups which are composed by whether or not U-turn installation the groups by Mann-Whitney U test. The result of significance test showed that intergroup comparison on mean by accident types made difference except rear-end accident type and by accident locations exit section only showed difference in significance level at 4-legged intersections, so the accident number have more where the U-turn is permitted than not. Response measures about the number of accidents were classified by whether accidents occurred and accident model were constructed using binomial logistic regression analysis method. The developed models show that the variables of conflict traffic, number of opposing lane are adopted as independent variable for both intersections. The variables of longitudinal grade for 3-legged signalized intersection and number of crosswalk for 4-legged signalized intersection at which the U-turn is permitted is adopted as independent variable only. These study results suggest that U-turn would be permitted at the intersection where the number of opposing lane is more than 3.5 each, the longitudinal grade of opposing road is upward flow and there is need to establish the U-turn traffic sign at signalized intersections.

Development of Optimal Path Algorithm for Advanced Traveler Information System (첨단교통정보시스템의 최적경로 알고리즘 개발)

  • Kim, Sung-Soo;Cha, Young-Min
    • Journal of Industrial Technology
    • /
    • v.21 no.A
    • /
    • pp.241-249
    • /
    • 2001
  • The objective of this paper is to develop the optimal path algorithm for dynamic route guidance system in advanced traveler information system (ATIS). The travel time is forecasted in each path between network nodes. Floyd-Warshall algorithm is used to find the optimal route based on this forecasted travel time in dynamic traffic network. This algorithm is modified to apply the real traffic network that has left-turn restriction, U-turn, and P-turn. A big value is assigned to one of arcs in turn restriction and a virtual node is used to consider U-turn and P-turn for Floyd-Warshall algorithm.

  • PDF

Network Representation Schemes for U-TURN and Implementation in the Vine-Based Dijkstra Shortest Path Algorithm (U-TURN을 포함한 가로망 표현 및 최단경로의 구현)

  • 최기주
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.3
    • /
    • pp.35-52
    • /
    • 1995
  • This paper reviews both network representation schemes of transportation network and algorithms for findings the shortest path between two points in the network. Two types of network representation schmes for considering U-Turn have been proposed along with some modifications of the vine-based Dijkstra shoretest path algorithm. The traditional Sioux-Fall network has been chosen and modified with the introduction of left-turn prohibitions and U-Turns for the purpose of evaluating the peroformance of two modified algorithms and network representation schemes(NA1 an d NA2 ). This type of modification in both network representation scheme (including network data) and algorithms is not only supposed to be needed for route guidance but supposed to contribute to finding more realistic path and estimating more accurate traffic voulume thorughout the entire network.

  • PDF

An Integration of Searching Area Extraction Scheme and Bi-directional Link Searching Algorithm for the Urban ATIS Application (도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탐색 알고리즘의 구현)

  • 이승환;최기주;김원길
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.45-59
    • /
    • 1996
  • The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

  • PDF

A study on the characteristics of heat transfer and pressure drop in plate type evaporator with U-turn for automotive air conditioner (유턴 흐름을 갖는 차량공조용 플레이트형 증발기의 전열특성에 관한 연구)

  • 강정길;김종수
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.11 no.4
    • /
    • pp.472-483
    • /
    • 1999
  • The evaporation heat transfer and pressure drop characteristics for HFC-l34a in flat plate type heat exchangers with enhanced beads were experimentally investigated. Three plate type evaporators with different geometric condition of U-turn area were tested. Mass fluxes were tested over the range of 83kg/$m^2$s to 166kg/$m^2$s, and heat fluxes were varied from 4㎾/$m^2$ to 12㎾/$m^2$. Evaporation temperature was 5$^{\circ}C$ with inlet qualities of 0.1 to 1.0. There was no notable difference in the heat transfer coefficient by geometric variation of U-turn area, but the third plate with cross-ribbed channel at U-turn area was better than others in the evaluation using volume goodness factor comparison. Also, the mixtures of HFC-l34a and PAG oil was tested to determine oil effects on heat transfer and pressure drop. As oil concentration was increased, heat transfer coefficient was increased by 22~48% up to the 3wt.%, but decreased by 14~22% at the 4wt.%. The pressure drop was increased by the maximum of 100% as oil concentration was increased.

  • PDF

Development of Evolution Program to Find the Multiple Shortest Paths in High Complex and Large Size Real Traffic Network (복잡도가 높고 대규모 실제 교통네트워크에서 다수 최적경로들을 탐색할 수 있는 진화 프로그램의 개발)

  • Kim, Sung-Soo;Jeong, Jong-Du;Min, Seung-Ki
    • Journal of Industrial Technology
    • /
    • v.22 no.A
    • /
    • pp.73-82
    • /
    • 2002
  • It is difficult to find the shortest paths using existing algorithms (Dijkstra, Floyd-Warshall algorithm, and etc) in high complex and large size real traffic networks The objective of this paper is to develop an evolution program to find the multiple shortest paths within reasonable time in these networks including turn-restrictions, U-turns, and etc.

  • PDF