• Title/Summary/Keyword: 가로망

Search Result 103, Processing Time 0.025 seconds

Emprical Tests of Braess Paradox (The Case of Namsan 2nd Tunnel Shutdown) (브라이스역설에 대한 실증적 검증 (남산2호터널 폐쇄사례를 중심으로))

  • 엄진기;황기연;김익기
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.3
    • /
    • pp.61-70
    • /
    • 1999
  • The Purpose of this study is to test whether Braess Paradox (BP) can be revealed in a real world network. Fer the study, Namsan 2nd tunnel case is chosen, which was shut down for 3 years for repair works. The revelation of BP is determined by analyzing network-wise traffic impacts followed by the tunnel closure. The analysis is conducted using a network simulation model called SECOMM developed for the congestion management of the Seoul metropolitan area. Also, the existence of BP is further identified by a before-after traffic survey result of the major arterials nearby the Namsan 2nd tunnel. The model estimation expected that the closure of Namsan 2nd tunnel improve the network-wise average traffic speed from 21.95km/h to 22.21km/h when the travel demand in the study area and congestion Pricing scheme on Namsan 1st & 3rd tunnels remain unchanged. In addition, the real world monitoring results of the corridors surrounding Namsan 2nd tunnel show that the average speed increases from 29.53km/h to 30.37km/h after the closure. These findings clearly identify the BP Phenomenon is revealed in this case.

  • PDF

A Dynamic assignment model for Dynamic Traffic Management in AM Peak (오전 첨두시의 동적 교통관리를 위한 동적 통행배정모형에 관한 연구)

  • 박준식;박창호;전경수
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.4
    • /
    • pp.97-108
    • /
    • 2001
  • A dynamic transportation management should be applied specially in AM peak because AM peak is more critical than PM peak in traffic volume and demand. AM peak trip can be characterized by commuting and schooling. which have the high level of usage on public transportation, and constraint on arrival time. So transportation management applied in AM peak could deal with a mode choice and an arrival time constrain. Researchers were involved in the dynamic transportation assignment models for management of congested traffic network. But, there were no models which considered a mode choice and an arrival time constrain should be included in management of AM peak. So there are limits to use exist models to control and analyze AM peak traffic. In this study, it is proposed the combined dynamic transportation model, considering a mode choice and the start time selection with arrival time constrains, based on Ran and Boyce's model. The proposed model is verified the compatibility by applying to the newly designed time space expanded network. The result shows that proposed model consistent with dynamic user optimal travel pattern. From this we certificate the applicability of the proposed model to control and analyze AM peak traffic.

  • PDF

A Path-Volume Simulation Method to Select Arterial Section of Road Network (경로 교통량 시뮬레이션 기법을 이용한 간선구간 설정 방법론 연구)

  • 황준문;조중래;손영태
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.5
    • /
    • pp.85-97
    • /
    • 2001
  • In this study, the purpose behind this research is to propose index to be used for classification of functional the urban streets and to select the feasible length of special management link by the index. This special management link help decision makers found a transportation policy. In order to perform functional classification, index such as average traveled distance, link VKT and VKT per length-lane are use at the study. Average traveled distance index is average traveled distance divided by length of Path k and VKT per length-lane is trip volume characteristic considering lanes and length of Path k. Special management links on which major part of the vehicle are selected with using Path-VKT which represents how many long-distance touring vehicles are on the arterial road. The selection of special management links are performed with network composed of 14 paths (arterial roads) in seoul The total distance of special management links resulted from the above analysis is 141km(35.0% of the whole paths length) and total VKT of the special management links is 4,152,475 VKT(45.2% of the whole paths VKT)

  • PDF

Space Syntactic Properties of the Street Network in Commercial District from the Perspective of Human Ecology - Focused on Euneungjeongi Culture Street in Daejeon, Korea (인간 생태학적 관점에서의 상업지구 내 가로망의 공간배열 특성 - 대전시 으능정이 문화거리를 중심으로)

  • Park, Joon Young;Lim, Soo Young;Ban, Yong Un;Jeong, Sang Kyu
    • KIEAE Journal
    • /
    • v.13 no.5
    • /
    • pp.17-22
    • /
    • 2013
  • This study aims at proposing a sound and sustainable development direction of an urban commercial district by identifying space syntactic properties, from the perspective of human ecology, of the street network in Enuengjeongi culture street as the representative commercial district of Daejeon City in Korea. The results are obtained through Angular Segment Analysis (ASA) on the street network in subject area for this study. It was found that most of the socially integrated nodes are arranged along the axis of main street in the district. However, in some of those nodes, it was investigated that the social integrative function have weakened, because open spaces as public space for the general public are occupied illegally by commercial purposes of shops and car parking. It was found that the socially isolated nodes are located at the district boundary connected to a relative narrow street, with a relatively low density of the commercial facilities. Besides, it was identified that a street width in the commercial district may be a factor affecting the social integration of a space on the basis of the openness of the space.

A Study on the Character of the Street-Network of a Sea-Village in the Steep Area (급경사지(急傾斜地) 어촌(漁村)마을의 가로특성(街路特性)에 관한 연구(硏究))

  • Kim, Suk-Su;Choi, Hyo-Seung
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.1 no.1
    • /
    • pp.77-86
    • /
    • 1999
  • The object of this study is to look for how to develop the style of residence formed spontaneously on the steep area by looking into the street-network and resident character in residence area and analysing fundamental style of residence. Specially, It is not easy to find out a study of a sea-village in the steep area. So, it is urgent to be developed a road-system and a style of residence which are able to be adapted to special circumstances and situation of ground. Therefore, th found out characters that a steep area contains, contents that are analyzed in this study are as follows : First, the order and the style of road-net formed to be adapted to circumstances of ground. Second, the style of road which is formed by directions. Third, the style of alley. Fourth, the relations with which alley and Madang are confronted each other.

  • PDF

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

A Model for the Estimation of Progression Adjustment: Factors on a Signal-Controlled Street Network (신호등이 있는 가로망에서의 신호 연동화보정계수 산정모형)

  • 김원창;오영태;이승환
    • Journal of Korean Society of Transportation
    • /
    • v.10 no.2
    • /
    • pp.25-42
    • /
    • 1992
  • The purpose of this paper is to construct a model to compute a progression adjustment factor on a signalized network. In a way to construct the model, a simulation method is introduced and the TRAF-NETSIM is used as a tool of simulation. The structure of the network chooses an urban arterial network so as to measure the effect of progression and compute average stopped delay on each link. A regression model is constructed by using the results of the simulation. The stepwise variable selection in the regression model in used. The findings of this paper are as follows: i)The secondary queue and platoon ratio are sensitive to the values of the progression adjustment factor ii) The continuous model can practically reflect on various situations in the real world. The platoon adjustment factor can be computed by this model and the data required for this model can be easily obtained in the field.

  • 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

A Study on Optimal Traffic Signal Controls in Urban Street Networks (도시 가로망에서의 최적교통신호등 결정모형의 실용화에 관한 연구)

  • 이승환
    • Journal of Korean Society of Transportation
    • /
    • v.5 no.1
    • /
    • pp.3-23
    • /
    • 1987
  • Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.

  • PDF

A Traffic Assignment With Intersection Delay for Large Scale Urban Network (대규모 도시부 교통망에서의 이동류별 회전 지체를 고려한 통행배정연구)

  • Kang, Jin Dong;Woo, Wang Hee;Kim, Tae Gyun;Hong, Young Suk;Cho, Joong Rae
    • Journal of Korean Society of Transportation
    • /
    • v.31 no.4
    • /
    • pp.3-17
    • /
    • 2013
  • The purpose of this study is to develop a traffic assignment model where the variable of signal intersection delay is taken into account in assigning traffic in large-scale network settings. Indeed, despite the fact that the majority of the increase in travel time or cost involving congested urban network or interrupted flow are accounted for by stop delays or congested delays at signal intersections, the existing traffic assignment models did not reflect this. The traffic assignment model considering intersection delays presented in this study was built based on the existing traffic assignment models, which were added to by the analysis technique for the computation of intersection delay provided in Korea Highway Capacity Manual. We can conclude that a multiple variety of simulation tests prove that this model can be applied to real network settings. Accordingly, this model shows the possibility of utilizing a model considering intersection delay for traffic policy decisions through analysis of effects of changes in traffic facilities on large urban areas.