• Title/Summary/Keyword: transit network

Search Result 218, Processing Time 0.02 seconds

The Study for an Improved Methodology of Rail Investment Rating System (철도투자평가체계 개선방안의 고찰)

  • Roh, Byoung-Kuk;Kim, Young-Bea;Jin, Hak-Ki
    • Proceedings of the KSR Conference
    • /
    • 2011.10a
    • /
    • pp.2192-2204
    • /
    • 2011
  • Recently, The government is actively transit road-oriented Traffic System to the eco-friendly and high-efficiency railroad-oriented transportation system for the sustainable green growth. The second plan of Nationwide Railway Network which has been officially announced rearrange to integration, multi-core, open architecture country by the railway network and integrate to the one mega city that rink an important city in one hour 30 minute. But the railroad industry is disadvantageous when it compares with the road industry on the ground that railroad industry peculiarities(a cost-benefit analysis, an environment value, etc) have not reflected in the (preliminary) feasibility study for SOC industry. The government establish Improved methodology of Rail Investment Rating System and improved preliminary feasibility study in railroad project by introduction many content(analysis periods, rate of discount, the benefits of shortening of transit hours, the estimation of traffic accident reduction benefits, investment cost of vehicle substitution and operation and maintenance cost of high speed rail) about the Improved methodology of Rail Investment Rating System. This study is intended to consideration the key content that was included in the Improved methodology of Rail Investment Rating System. In addition, the points to be considered for additional study have been reviewed in this study. We hope we will carry out make a reasonable and objective Rail Investment Rating System and to perform the railway industry of the virtuous cycle such improvement plans are reflected at a hereafter railroad section.

  • PDF

An Empirical Study on the Relationship between Subway Trips and Characteristics of Subway Catchment Area. (역세권 특성이 지하철 이용수요에 미치는 영향분석)

  • Jo, Hyun-Woo;Lee, Seok-Hwan;Shin, Kang-Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5191-5198
    • /
    • 2010
  • Although numerous studies have analyzed the relationship between subway travel demand (STD) and various characteristics of subway catchment area (SCA), a few studies examined the relationship between STD and the structure of pedestrian networks within each SCA. Hence, this study evaluates the structure of pedestrian networks within 79 SCAs in the city of Busan using Space syntax and investigates the relationship between STD and several characteristics of SCA including the spatial structure of pedestrian network. The analysis results show that the spatial integration of pedestrian networks within the SCAs, which represents the magnitudes of walking accessibility to subway station, is positively associated with STD among the three spatial indexes such as integration, connectivity, and intelligibility. In addition, the results show that STD significantly increases as the number of travel gathering facilities and the average floor area ratio within the SCAs increase. This study ultimately corroborates that designing the grid pedestrian network and assigning the travel gathering facilities to the compact buildings within SCAs are needed to ameliorate the spatial structure of SCA in the city of Busan as transit-oriented development system.

Constructing Transfer Data in Seoul Metropolitan Urban Railway Using Transportation Card (교통카드기반 수도권 도시철도 환승자료 구축방안)

  • Lee, Mee Young;Sohn, Jhieon;Cho, Chong Suk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.4
    • /
    • pp.33-43
    • /
    • 2016
  • Public transportation card data, which is collected for purposes of the Integrated Public Transportation Fare System, provides neither transfer time nor transfer frequency occurring on the metropolitan city-rail (MCR). And because there are no transfer toll gates installed on the MCR, data on transfers between lines are estimated through means such as elicitations using survey questionnaire, or otherwise through macroscopic observations, which poses the risk of transfer time and frequencies being underestimated. For the accurate estimation thereof, an explanation of the transit path that arises between the Entry-and Exit-Gates must be provided. The purpose of this research is twofold : 1) to build a transit path model to reflect the current state of transfer movements on the basis of transportation card reader data, and 2) to deduce information on transfers occurring in the greater metropolis. To achieve these aims, the idea of Big Nodes is introduced in the model to align transportation card reader operation system characteristics with those of the MCR network. The link-label method is applied in the model as well to make certain that the MCR network runs in an effective manner. Administrative information obtained by the transportation card reader is used to derive transfer time and frequency both in the city's mid-zones, and in the Seoul-Gyeonggi-Incheon district's large-zones. Public transportation card data from a single specific day in year 2014 is employed in the building of the quantified transfer specific data. Extended usage thereof as providing comprehensive data of transfer resistance on the MCR is also examined.

Development of Integrated Accessibility Measurement Algorithm for the Seoul Metropolitan Public Transportation System (서울 대도시권 대중교통체계의 통합 시간거리 접근성 산출 알고리즘 개발)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Korean Regional Science Association
    • /
    • v.33 no.1
    • /
    • pp.29-41
    • /
    • 2017
  • This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

Finding a Minimum Fare Route in the Distance-Based System (거리비례제 요금부과에 따른 최소요금경로탐색)

  • Lee, Mee-Young;Baik, Nam-Cheol;Nam, Doo-Hee;Shin, Seon-Gil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.101-108
    • /
    • 2004
  • The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

Generalized K Path Searching in Seoul Metropolitan Railway Network Considering Entry-Exit Toll (진입-진출 요금을 반영한 수도권 도시철도망의 일반화 K-경로탐색)

  • Meeyoung Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.6
    • /
    • pp.1-20
    • /
    • 2022
  • The basic way to charge vehicles for using road and public transport networks is the entry-exit toll system. This system works by reading Hi-Pass and public transportation cards of the vehicles using card readers. However, the problems of navigating a route in consideration of entry-exit toll systems include the non-additive costs of enumerating routes. This problem is known as an NP-complete task that enumerates all paths and derives the optimal path. So far, the solution to the entry-exit toll system charging has been proposed in the form of transforming the road network. However, unlike in the public transport network where the cards are generalized, this solution has not been found in situations where network expansion is required with a transfer, multi-modes and multiple card readers. Hence, this study introduced the Link Label for a public transportation network composed of card readers in which network expansion is bypassed in selecting the optimal path by enumerating the paths through a one-to-one k-path search. Since the method proposed in this study constructs a relatively small set of paths, finding the optimal path is not burdensome in terms of computing power. In addition, the ease of comparison of sensitivity between paths indicates the possibility of using this method as a generalized means of deriving an optimal path.

Pushback Based Advanced Packet Marking Mechanism for Traceback (Pushback 방식을 적용한 패킷 마킹 기반 역추적 기법)

  • Lee, Hyung-Woo;Choi, Chang-Won;Kim, Tai-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1120-1130
    • /
    • 2004
  • Distributed Denial-of-Service(DDoS) attack prevent users from accessing services on the target network by spoofing its origin source address with a large volume of traffic. The objective of IP Traceback is to determine the real attack sources, as well as the full path taken by the attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. Existing proactive tracing scheme(such as packet marking and messaging) prepares information for tracing when packets are in transit. But, these scheme require additional network overhead. In this paper, we propose a "advanced Traceback" mechanism, which is based on the modified Pushback system with secure router mechanism. Proposed mechanism can detect and control DDoS traffic on router and can generate marked packet for reconstructing origin DDoS attack source, by which we can diminish network overload and enhance Traceback performance.

  • PDF

Vine Based Dial Algorithm (덩굴망기반 Dial 알고리즘 연구)

  • Lee, Mee Young;Kim, Jong Hyung;Jung, Dongjae;Shin, Seongil
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.5
    • /
    • pp.39-47
    • /
    • 2018
  • The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

Network Betweenness Centrality and Passenger Flow Analysis of Seoul Metropolitan Subway Lines (서울 수도권 지하철망의 호선별 망 매개 중심성과 승객 흐름 분석)

  • Lee, Kang Won;Lee, Jung Won
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.95-104
    • /
    • 2018
  • Using network betweenness centrality we attempt to analyze the characteristics of Seoul metropolitan subway lines. Betweenness centrality highlights the importance of a node as a transfer point between any pairs of nodes. This 'transfer' characteristic is obviously of paramount importance in transit systems. For betweenness centrality, both traditional betweenness centrality measure and weighted betweenness centrality measure which uses monthly passenger flow amount between two stations are used. By comparing traditional and weighted betweenness centrality measures of lines characteristics of passenger flow can be identified. We also investigated factors which affect betweenness centrality. It is the number of passenger who get on or get off that significantly affects betweenness centrality measures. Through correlation analysis of the number of passenger and betweenness centrality, it is found out that Seoul metropolitan subway system is well designed in terms of regional distribution of population. Four measures are proposed which represent the passenger flow characteristics. It is shown they do not follow Power-law distribution, which means passenger flow is relatively evenly distributed among stations. It has been shown that the passenger flow characteristics of subway networks in other foreign cities such as Beijing, Boston and San Franciso do follow power-law distribution, that is, pretty much biased passenger flow traffic characteristics. In this study we have also tried to answer why passenger traffic flow of Seoul metropolitan subway network is more homogeneous compared to that of Beijing.

Theoretical Performance Analysis between Attack Prevention Schemes and Attack Mitigation Schemes (공격차단 기법과 공격경감 기법 간 이론적 성능 분석)

  • Ko Kwang-Sun;Eom Young-Ik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.84-92
    • /
    • 2006
  • To defeat abnormal traffic driven by DoS (Denial-of-Service) or DDoS (Distributed DoS), there has been a variety of researches or studies in a few decades. In this paper, we present the results of theoretical performance analysis between attack prevention schemes and attack mitigation schemes. The former is a scheme that prevents abnormal incoming traffic from forwarding into a specific network based on filtering rules, and the latter is a scheme that makes some perimeter or intermediate routers, which exist on the traffic forwarding path, prevent abnormal traffic based on their own abnormal traffic information, or that mitigates abnormal traffic by using quality-of-service mechanisms at the gateway of the target network. The aspects of theoretical performance analysis are defined as the transit rates of either normal traffic or false-positive traffic after an attack detection routine processes its job, and we also present the concrete network bandwidth rates to control incoming traffic.