• Title/Summary/Keyword: 통합 대중교통망

Search Result 17, Processing Time 0.019 seconds

A Model for Shortest Path Calculation on lntermodal Transportation Network (복합 교통망에서의 최적경로산정 모형개발)

  • 최기주;장원재
    • Journal of Korean Society of Transportation
    • /
    • v.16 no.4
    • /
    • pp.167-186
    • /
    • 1998
  • 자동차보급의 대중화와 함께 버스, 전철 등 대중교통체계의 지속적인 서비스 확충으로 인해 다양한 교통망의 이용행태가 나타나고 있다. 즉, 승용차를 이용하다가 대중교통수단을 이용하는 경우가 발생하게 되고 이러한 환경에서, 기타 통행대안들(예를 들면 목적지, 수단, 경로 등)이 효율적으로 연계 선택되어질 수 있도록 지원하여 전체 교통체계의 이용효율을 높일 수 있는 방안들이 강구되도록 요구되어지고 있다. 본고는 이런 관점에서 복합교통망에서의 경로안내 체계의 구현을 위한 알고리즘개발과 평가를 주목적으로 한다. 즉, 복합교통망에서의 경로탐색모형과 이 모형에 적용가능한 경로탐색 알고리즘의 제시하고, 이를 위해 복합교통말의 한 축이 되는 대중교통망의 특징을 분석하고 대중교통망에서의 경로탐색알고리즘을 평가하였으며 이를 바탕으로 일반가로망과의 최단경로구축의 통합방안을 제시하였다. 알고리즘의 구현과정을 필요한 데이터의 구축과정과 함께 도시함으로서 모형과 알고리즘에 대한 평가와 함께 실제 구현시 필요한 제반 사항들도 검토하였으며, 장래의 연구과제를 아울러 제시하였다.

  • PDF

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.

A Path-Based Traffic Assignment Model for Integrated Mass Transit System (통합 대중교통망에서의 경로기반 통행배정 모형)

  • Shin, Seong-Il;Jung, Hee-Don;Lee, Chang-Ju
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.3
    • /
    • pp.1-11
    • /
    • 2007
  • Seoul's transportation system was changed drastically starting the first of June in two thousand. This policy includes integrated distance-based fare system and public transportation card system called smart card. Especially, as public transportation card data contains individual travel, transfer and using modes information it is possible to catch the characteristics of path-based individuals and mass transit. Thus, public transportation card data can contribute to evaluate the mass transit service in integrated public transportation networks. In addition, public transportation card data are able to help to convert previous researches and analyses with link-based trip assignment models to path-based mass transit service analysis. In this study, an algorithm being suitable for path-based trip assignment models is suggested and proposed algorithm can also contribute to make full use of public transportation card data. For this, column generation algorithm hewn to draw the stable solution is adopted. This paper uses the methodology that is to take local approximate equilibrium from partial network and expand local approximate equilibrium to global equilibrium.

  • PDF

Development of Transit Assignment Model Considering an Integrated Distance-Based Fare System and In-Vehicle Congestion (통합거리비례요금제와 차내혼잡을 반영하는 통합대중교통망 통행배정 모형 구축)

  • Park, Jun-Hwan;Sin, Seong-Il;Im, Yong-Taek;Im, Gang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.2 s.95
    • /
    • pp.133-143
    • /
    • 2007
  • Previous studies on the transit assignment hardly show its achievement in research but have many limitations not only in theory but also in practice. This paper presents an integrated transit assignment model taking into account cost functions of multiple modes, such as auto, bus and subway, which represent an integrated network. An integrated transit network including cost functions and in-vehicle congestion needs to be developed. In addition, a link fare calculation model needs to be developed and applied to the model to calculate path travel costs. Based on these sub-models, a path-based traffic assignment model, which considers in-vehicle congestion and an integrated distance-based fare system in the integrated traffic network, is developed.

A Methodology of Multimodal Public Transportation Network Building and Path Searching Using Transportation Card Data (교통카드 기반자료를 활용한 복합대중교통망 구축 및 경로탐색 방안 연구)

  • Cheon, Seung-Hoon;Shin, Seong-Il;Lee, Young-Ihn;Lee, Chang-Ju
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.233-243
    • /
    • 2008
  • Recognition for the importance and roles of public transportation is increasing because of traffic problems in many cities. In spite of this paradigm change, previous researches related with public transportation trip assignment have limits in some aspects. Especially, in case of multimodal public transportation networks, many characters should be considered such as transfers. operational time schedules, waiting time and travel cost. After metropolitan integrated transfer discount system was carried out, transfer trips are increasing among traffic modes and this takes the variation of users' route choices. Moreover, the advent of high-technology public transportation card called smart card, public transportation users' travel information can be recorded automatically and this gives many researchers new analytical methodology for multimodal public transportation networks. In this paper, it is suggested that the methodology for establishment of brand new multimodal public transportation networks based on computer programming methods using transportation card data. First, we propose the building method of integrated transportation networks based on bus and urban railroad stations in order to make full use of travel information from transportation card data. Second, it is offered how to connect the broken transfer links by computer-based programming techniques. This is very helpful to solve the transfer problems that existing transportation networks have. Lastly, we give the methodology for users' paths finding and network establishment among multi-modes in multimodal public transportation networks. By using proposed methodology in this research, it becomes easy to build multimodal public transportation networks with existing bus and urban railroad station coordinates. Also, without extra works including transfer links connection, it is possible to make large-scaled multimodal public transportation networks. In the end, this study can contribute to solve users' paths finding problem among multi-modes which is regarded as an unsolved issue in existing transportation networks.

Analysis of Transit Passenger Movements within Seoul-Gyeonggi-Incheon Area using Transportation Card (대중교통카드자료를 활용한 수도권 통행인구 이동진단)

  • Lee, Mee Young;Kim, Jong Hyung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.5
    • /
    • pp.12-19
    • /
    • 2016
  • An average of 20 million individual transit unit activities per day on the Seoul-Gyeonggi-Incheon public transportation network are provided as transportation card analysis data by the metropolitan district (99.02% by 2014 standard, Humanlive, 2015.4). The metropolitan transportation card data can be employed in a comprehensive analysis of public transportation users' current transit patterns and by means of this, an effective use plan can be explored. In enhancing the existing information on the bus and rail integrated network of the metropolis with public transportation card data, the constraints in the existing methodology of metropolitan transit analysis, which functions on a zone unit origin and destination basis, can be overcome. Framework for metropolitan public transportation card data based integrated public transportation analysis, which consists of bus and rail integrated transport modes, is constructed, and through this, a single passenger's transit behavior transit volume can be approximated. This research proposes that in the use of metropolitan public transportation card data, integrated public transportation usage, as a part of individual passenger spatial movements, can be analyzed. Furthermore, metropolitan public transportation card usage data can provide insights into understanding not only movements of populations taking on transit activities, but also, characteristics of metropolitan local space.

Finding Alternative Routes in Inter Modal Transit Networks Considering Constraints (제약조건을 고려한 통합대중교통망의 대안경로탐색)

  • Lee Mee-Young;Baek Nam-Chul
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.4 no.1 s.6
    • /
    • pp.1-13
    • /
    • 2005
  • For integrated transit networks operated with diverse transit modes, it is difficult to find related literatures on the provision of multiple travel time routes information. This study proposes a methodology on how to select K number of least time transit routes in the integrated transit network with two modes, bus and subway. In the Proposed method, three constraints usually (will be) encountered for decision by users-(1) service time constraints of travel modes, (2) maximum payment fare constraints under the integrated distance based fare system, and (3) maximum number of transfer constraints - are taken into consideration in the searched routes. The experimental studies shows that the proposed method properly provides K number of least time routes. In addition, it somehow proves that by combinatorially considering three constraints the proposed method can be evaluated as to enlarge the quality as well as the diversity of route information demanded by users.

  • PDF

Changes of Time-Distance Accessibility by Year and Day in the Integrated Seoul Metropolitan Public Transportation Network (서울 대도시권 통합 대중 교통망에서 연도별 및 요일별 시간거리 접근도 변화)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.21 no.4
    • /
    • pp.335-349
    • /
    • 2018
  • This study analyzes the effect of the changes in traffic environments such as transportation speeds on the time-distance accessibility for the public transportation passengers. To do this, we use passenger transaction databases of the Seoul metropolitan public transportation system: one week for each of the three years (2011, 2013, and 2015). These big data contain the information about time and space on the traffic trajectories of every passenger. In this study, the time-distances of links between subway stations and bus stops of the public transportation system at each time are calculated based on the actual travel time extracted from the traffic-card transaction database. The changes in the time-distance accessibility of the integrated transportation network from the experimental results can be summarized in two aspects. First, the accessibility tends to decline as the year goes by. This is because the transportation network becomes more complicated and then the average moving speed of the vehicles is lowered. Second, the accessibility tends to increase on the weekend in the analysis of accessibility changes by day. This tendency is because the bus speeds on bus routes on the weekend are faster than other days. In order to analyze the accessibility changes, we illustrate graphs of the vehicle speeds and the numbers of passengers by year and day.

A K Least Time Paths Searching Algorithm for Time Dependent Intermodal Transportation Networks with Departure Time Schedule Constraints (출발시간제약이 존재하는 동적 복합교통망의 K최소시간경로탐색)

  • Jo, Jong-Seok;Sin, Seong-Il;Mun, Byeong-Seop;Im, Gang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.3 s.89
    • /
    • pp.167-176
    • /
    • 2006
  • An minimum path algorithm for integrated networks with departure time constraints require considering arrival time of arriving mode, transfer time. waiting time, and departure time of next mode. Integrated network with diverse modes commonly include departure time constraints. Because public mode suck as train and airplane have fixed service schedule which provide passengers. This study developed the k-path algorithm in integrated network with time varying conditions and departure time constraints. We proposed the extended method based on entire path deletion method, and examined the application of the proposed algorithm through case study.