• Title/Summary/Keyword: 서울 수도권 지하철

Search Result 48, Processing Time 0.018 seconds

Greedy Heuristic Algorithm for the Optimal Location Allocation of Pickup Points: Application to the Metropolitan Seoul Subway System (Pickup Point 최적입지선정을 위한 Greedy Heuristic Algorithm 개발 및 적용: 서울 대도시권 지하철 시스템을 대상으로)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.14 no.2
    • /
    • pp.116-128
    • /
    • 2011
  • Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

  • PDF

Prospect for the metropolitan area railway service in Reparation for the railway connection between the South and the North (남북철도연결을 대비한 수도권 철도망 정비방향)

  • 신종서
    • Proceedings of the KSR Conference
    • /
    • 2001.05a
    • /
    • pp.52-57
    • /
    • 2001
  • ㆍ수도권 철도는 우리나라의 경제성장과 함께 증가하는 교통처리 대책으로 1974년 8월 15일 서울지하철 1호선과 함께 경인선 서울∼인천간, 경부선 서울∼수원간, 경원선 용산∼청량리∼성북간을 복선 전철화 하여 도시철도로 전환, 이에 따라 수도권 위성도시의 발전과 인구 폭증으로 안산, 산본, 평촌, 분당, 일산 등 신도시를 개발하고 교통난 해소를 위해 서울지하철은 1호선에서 9호선가지 건설중이며, 수도권 철도는 경부선 영등포∼천안간 2복선전철과 안산선, 분당선, 일산선, 경의선, 경원선, 중앙선, 경춘선, 용산선, 신공항선 등 복선전철화와 경부고속철도 등 수송능력 증강을 위해 건설하고 있다. (중략)

  • PDF

Characteristics and Efficiency Analysis of Evolutionary Seoul Metropolitan Subway Network (진화하는 서울 지하철 망의 특성과 효율성 분석)

  • Zzang, See-Young;Lee, Kang-Won
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.3
    • /
    • pp.388-396
    • /
    • 2016
  • The metropolitan subway network of Seoul has gone through many evolutionary processes in past decades to disperse the floating population and improve the traffic flow. In this study, we analyzed how the structural characteristics and the efficiency of the subway network have changed according to the dynamic evolutionary processes of the metropolitan subway network of Seoul. We have also proposed new measures that can be used to characterize the structural properties of the subway network more practically. It is shown that the global efficiency is about 74%, which is higher than those of subway networks of foreign countries. It should also be considered that passenger flow between stations is even higher, at about 85%. Since the private lines, including line 9, the New Bundang line, the Uijeongbu line, and the Ever line do not release their traffic data since September, 2013, only 5 years of data from September, 2008 to September, 2013 is available. So, in this study we limit the analysis period to these 5 years.

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.

Classification of the Seoul Metropolitan Subway Stations using Graph Partitioning (그래프 분할을 이용한 서울 수도권 지하철역들의 분류)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.15 no.3
    • /
    • pp.343-357
    • /
    • 2012
  • The Seoul metropolitan subway system can be represented by a graph which consists of nodes and edges. In this paper, we study classification of subway stations and trip behaviour of subway passengers through partitioning the graph of the subway system into roughly equal groups. A weight of each edge of the graph is set to the number of passengers who pass the edge, where the number of passengers is extracted from the transportation card transaction database. Since the graph partitioning problem is NP-complete, we propose a heuristic algorithm to partition the subway graph. The heuristic algorithm uses one of two alternative objective functions, one of which is to minimize the sum of weights of edges connecting nodes in different groups and the other is to maximize the ratio of passengers who get on the subway train at one subway station and get off at another subway station in the same group to the total subway passengers. In the experimental results, we illustrate the subway stations and edges in each group by color on a map and analyze the trip behaviour of subway passengers by the group origin-destination matrix.

  • PDF

Visualization of Passenger Flows of the Metropolitan Seoul Subway System (서울 수도권 지하철 교통망 승객 흐름의 시각화)

  • Kim, Ho-Sun;Park, Jong-Soo;Lee, Keum-Sook
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.397-405
    • /
    • 2010
  • This study proposes visualization methods of the diurnal passenger flows on the Metropolitan Seoul Subway system (MSSs) and examines the passenger trip behaviors of major central business districts (CBDs). We mine the MSS passenger flow information from a single day T-card passenger trip transaction database. It is practically intractable to analyze such flows, involving huge, complex space-time data, by means of general statistical analysis. On the other hand, dynamic visualizations of the passenger flows make it possible to analyze intuitively and to grasp effectively characteristics of the passenger flows. We thus propose several methods to visualize the passenger flow information. In particular, we visualize dynamic passenger flows of each link on the subway network and analyze the time-space characteristics of passenger ridership for the three major CBDs. As the result, we can ascertain the strong association between CBD and subway line and clarify the distinction among three major CBDs in the diurnal patterns of subway passenger flow.

수도권 도시철도 시스템의 운영상 문제점과 개선 방향

  • 손의영
    • Journal of the Korean Society for Railway
    • /
    • v.3 no.4
    • /
    • pp.23-35
    • /
    • 2000
  • 지난 30년간 수도권은 많은 변화를 겪어왔다. 무엇보다도 1970년에 948만 인에 불과하던 인구가 1990년에는 거의 투 배인 1,859만 인으로. 1998년에는 2,130만 인으로 계속 증가하였다. 버스만으로는 대중교수단의 역할을 수행할 수 없게 되자 1970년대 초반부터 도시철도를 건설하기 시작하였다. 이후 도시철도는 서울시전역에서 건설되기 시작해서 이제 서울시내 만에도 8개 노선, 총 연장 280 km의 지하철망을 구축하게 되었다. 지하철 외에 서울시 외곽 도시를 연결하는 7개 노선, 총 연장 172 km의 전철망 또한 구축되었다. 지하철망과 전철망을 합한 수도권내 도시철도망은 이제 14개 노선, 총 연장 452 km에 달하며, 승객수송 분담율에 있어서도 버스보다 더 높은 비중을 차지하고 있다. (중략)

  • PDF

Analysis of Passenger Flows in the Subway Transportation Network of the Metropolitan Seoul (서울 수도권 지하철 교통망에서 승객 흐름의 분석)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.316-323
    • /
    • 2010
  • We propose a method to find flows of transit users in the subway transportation network of the metropolitan Seoul and analyze the passenger flows on some central links of the network. The transportation network consists of vertices for subway stops, edges for links between two adjacent subway stops, and flows on the edges' Each subway transit user makes a passenger flow along edges of the shortest path from the origin stop to the destination stop in his trip. In this paper, we have developed a new algorithm to find the passenger flow of each link in the subway network from a large trip-transaction database of subway transit users. We have applied the algorithm to find the passenger flows from one day database of about 5 million transactions by the subway transit users. As results of the experiments, the travel behavior on 4 central subway links is analyzed in passenger flows and top 10 flows among all subway links are explained in a table.

Mining Commuter Patterns from Large Smart Card Transaction Databases (대용량 교통카드 트랜잭션 데이터베이스에서 통근 패턴 탐사)

  • Park, Jong-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06a
    • /
    • pp.38-39
    • /
    • 2010
  • 수도권 대중교통 이용자는 2004년 서울시의 대중교통 체계 개편에 따라 교통 카드를 사용하여 버스와 지하철을 이용하게 되었다. 교통 카드를 사용하는 각 승객의 승차와 하차에 관한 데이터가 하나의 트랜잭션으로 구성되고, 하루 천만 건 이상의 트랜잭션들로 구성된 대용량 교통카드 트랜잭션 데이터베이스가 만들어지고 있다. 대중교통을 이용하는 승객들의 승차와 하차에 관한 여러 정보를 담고 있는 교통카드 트랜잭션 데이터베이스에서 유용한 패턴이나 정보를 탐사해내는 연구가 계속 진행되고 있다. 이런 연구 결과는 수도권 대중교통 정책을 입안하는데 중요한 기초 자료가 되고 수도권 승객들에게 대중교통을 보다 잘 이용할 수 있는 정보로 제공된다. 교통카드 이용률은 2006년 79.5%, 2007년 80.3%, 2008년 81.6%로 점차적으로 증가하고 있다. 대용량의 교통카드 트랜잭션 데이터베이스에 대한 연구를 살펴보면 하루 동안의 교통카드 트랜잭션 데이터베이스에서 순차 패턴을 탐사하는 알고리즘을 연구하였고[1], 승객들의 통행 패턴에 대한 분석연구를 확장하여 일 년에 하루씩 2004년에서 2006년까지 3일간의 교통카드 트랜잭션 데이터베이스로부터 승객 시퀀스의 평균 정류장 개수와 환승 횟수 등을 연도별로 비교하였다[2]. 수도권 지하철 시스템의 특성에 관한 연구로는 네트워크 구조 분석이 있었고[3], 승객의 기종점 통행 행렬(Origin-Destination trip matrix)에 의한 승객 흐름의 분포가 멱함수 법칙(power law)임을 보여주는 연구가 있었고[4], 지하철 교통망에서 모든 링크상의 승객들의 흐름을 찾아내는 연구가 있었다[5]. 본 논문에서는 교통카드 트랜잭션 데이터베이스에서 지하철 승객들의 통근 패턴을 탐사해내는 방법을 연구하였다. 수도권 지하철 네트워크에 대한 정보를 입력하고 하루치의 교통카드 트랜잭션 데이터베이스에 연구된 방법을 적용하여 8가지 통근 패턴들을 탐사해내고 분석하였다. 탐사된 패턴들 중에서 많은 승객들이 지지하는 출퇴근 패턴에 대해서는 시간대별로 승객수를 그래프로 보여주었다.

  • PDF

Analysis of Seoul Metropolitan Subway Network Characteristics Using Network Centrality Measures (네트워크 중심성 지표를 이용한 서울 수도권 지하철망 특성 분석)

  • Lee, Jeong Won;Lee, Kang Won
    • Journal of the Korean Society for Railway
    • /
    • v.20 no.3
    • /
    • pp.413-422
    • /
    • 2017
  • In this study we investigate the importance of the subway station using network centrality measures. For centrality measures, we have used betweenness centrality, closeness centrality, and degree centrality. A new measure called weighted betweenness centrality is proposed, that combines both traditional betweenness centrality and passenger flow between stations. Through correlation analysis and power-law analysis of passenger flow on the Seoul metropolitan subway network, we have shown that weighted betweenness centrality is a meaningful and practical measure. We have also shown that passenger flow between any two stations follows a highly skewed power-law distribution.