• 제목/요약/키워드: U-Turn

검색결과 221건 처리시간 0.032초

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

  • Park, Chahgwha;Yoon, Byoungjo;Kang, Bongsuk
    • 한국재난정보학회 논문집
    • /
    • 제11권4호
    • /
    • pp.597-606
    • /
    • 2015
  • 지금까지 유턴차로의 설치방법들에 관한 연구는 다양하게 이루어져 왔다. 그러나 구체적인 기준이 제시되지 못하고 있어 유턴차로 설계기준의 마련이 시급한 것으로 판단된다. 본 연구에서는 인천광역시 상업지역을 대상으로 현장조사를 수행하고, 해당 자료를 활용하여 도시부상업지역 내 신호교차로의 효율적인 좌회전 처리를 위한 유턴허용구간의 적정길이와 전방교차로로부터 유턴 허용구간까지의 최소거리를 산정하여 구체적인 설계기준을 제시하였다. 연구 결과 유턴허용구간의 적정길이는 32m로 산출되었고, 전방 교차로로부터 유턴허용구간의 시점까지의 최소 이격거리는 좌회전 차로수가 1차로인 경우 72m, 2차로인 경우 40m, 3차로인 경우 24m인 것으로 도출되었다. 이렇게 도출된 결과값을 현장조사 값과 비교한 결과 유턴허용구간의 길이 및 전방교차로로부터 유턴허용구간 시점까지의 최소 이격거리가 유사한 조건하에서도 차이가 크게 남을 확인할 수 있었다. 이는 유턴차로의 설계에 관한 구체적인 기준이 제시되어있지 않아 발생된 결과로 판단된다. 본 연구의 결과를 향후 유턴차로의 설계에 반영한다면 보다 안전하고 효율적인 교차로 운영이 가능해 질 수 있을 것으로 판단된다.

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

  • 김재홍
    • 농업과학연구
    • /
    • 제25권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)

  • 강종호;김경환;김성문
    • 대한토목학회논문집
    • /
    • 제34권4호
    • /
    • pp.1279-1287
    • /
    • 2014
  • 본 연구의 목적은 도시부 신호교차로에서의 유턴 사고모형을 개발하는 것이다. 창원시 3지, 4지 신호교차로의 유턴 교통사고 자료에 대한 특성을 분석하고 로지스틱 회귀분석에 의해 사고예측모형을 추정하였다. 먼저 유턴 운영에 의한 교통사고 발생에 차이가 있는지를 검정하기 위해 맨-위트니 U검정으로 평균차이를 검정하였다. 분석 결과 4지 신호교차로의 사고유형별 구분에 있어서는 추돌사고를 제외한 유형에서, 사고위치별에 있어서는 유출부 사고가 유턴구역이 설치된 집단의 사고발생건수가 더 많은 것으로 분석되었다. 교통사고건수에 대한 반응척도를 이항으로 분류하고 사고예측모형을 추정한 결과 상충교통량, 대향차로수와 같은 독립변수가 공통적인 영향요인으로 분석되었으며, 3지 신호교차로에서는 종단 경사, 4지 신호교차로에서는 횡단보도수가 공통영향 이외에 특정변수로 도출되었다. 도시부 신호교차로에서 유턴 운영을 위해서는 유턴 구역 대향차로수가 사고무발생 교차로의 평균차로수인 3.5개 차로 이상이며, 접근부의 종단선형이 상향경사일 경우에 설치를 고려할 수 있을 것으로 제안된다. 또한 유턴 차량의 많은 부분이 횡단보도 시간을 이용하여 회전하는 점을 고려하여 유턴 시기에 대한 지시표지를 설치할 필요가 있다.

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

  • 김성수;차영민
    • 산업기술연구
    • /
    • 제21권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

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

  • 최기주
    • 대한교통학회지
    • /
    • 제13권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

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

  • 이승환;최기주;김원길
    • 대한교통학회지
    • /
    • 제14권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)

  • 강정길;김종수
    • 설비공학논문집
    • /
    • 제11권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)

  • 김성수;정종두;민승기
    • 산업기술연구
    • /
    • 제22권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