• Title/Summary/Keyword: 환승 스케줄

Search Result 11, Processing Time 0.031 seconds

Timetabling and Analysis of Train Connection Schedule Using Max-Plus Algebra (Max-Plus 대수를 이용한 환승 스케줄 시간표 작성 및 분석)

  • Park, Bum-Hwan
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.2
    • /
    • pp.267-275
    • /
    • 2009
  • Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

A Study on the Enhancement for Minimum Connecting Time of Incheon International Airport (공항의 환승율 재고를 위한 MCT의 향상 방안에 대한 정책적 제안 (인천국제공항을 중심으로))

  • Lee, Kang-Seok
    • The Korean Journal of Air & Space Law and Policy
    • /
    • v.22 no.2
    • /
    • pp.85-108
    • /
    • 2007
  • 동북아시아지역에서 인천국제공항이 최고의 허브공항으로서 역할을 위해서는 무엇보다도 환승율에 대한 연구가 필요하다고 판단된다. 인천국제공항은 2005년도에 3,054,485만명의 환승여객을 처리하여 환승율은 11.9% 를 기록하였는데 이는 동북아시아의 경쟁허브공항의 환승율인 30-40%와 비교해보면 공항경쟁력이 상당히 뒤쳐진다고 할 수 있다. 이러한 약점을 보완하기 위하여 여러 가지 관련 인자들을 검토하는 것이 중요하다고 판단되어지는데 그중에서 인천국제공항의 비행편최소연결시간(MCT)을 개선하는 것이 필요하다. 이러한 문제를 개선하기 위해서는 항공기 스케줄, 항공사 배치, 게이트 배정방법, 수하물처리, 여객 동선 등이 함께 검토되어야 할 것이다. 그러나 이러한 인자들에 대한 세부적인 분석이 단기간에 걸쳐 해결되는 문제가 아니기 때문에 본 연구에서는 외국 허브공항의 MCT 수준, 관리방법, 국외사례 등을 고찰해 보고 동북아시아에서 허브공항을 향한 인천국제공항의 환승율 제고차원에서 정책적 방안을 제시하고자 한다.

  • PDF

A LOGIT based Traffic Assignment Model Considering Passenger Transfer on Railway Network (철도 네트워크에서 환승수요를 고려한 다항로짓 기반 통행배정 모형 연구)

  • Park, Bum-Hwan;Rho, Hag-Lae;Cheon, Seung-Hoon;Lee, Jin-Sun
    • Journal of the Korean Society for Railway
    • /
    • v.14 no.3
    • /
    • pp.276-284
    • /
    • 2011
  • In our study, we present a new LOGIT-based traffic assignment model applicable to intercity railway network. Most traffic assignment models have been developed for public transit assignment in urban area, so that they are known to produce unrealistic results in intercity railway demand analysis. Especially, since the introduction of KTX, more passengers are using a route including KTX service and the schedule becomes more compatible with transfer. Our study presents a new LOGIT-based traffic assignment model considering passenger transfer. To do so, we suggest a new route search algorithm to find K paths with non increasing order in the utility value.

An Analysis for Transferring Connectivity at Incheon international Airport (허브공항의 환승연계성 분석연구(인천국제공항을 대상으로))

  • Park, Yong-Hwa;Kim, Seong-Yeong;Kim, Jung-Yeop
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6 s.92
    • /
    • pp.75-85
    • /
    • 2006
  • Recently. large number of countires have been focused on the construction of container seaport and hub airport to enrole as the center of logistics. In particular, the East Asian nations have been enhanced their airports' facilities in order to accommodate for demand of global market environment. In Korea, Incheon International Airport (ICN) was opened in 2001 to take leading role as the Northeast Asian main hub airport. The purpose of this research is to analyze the transferring connectivity at ICN. To analyze its connectivity, this research has been applies two methodologies ; wane structure and minimum or maximun connection time analysis It has analyzed the temporal configuration as the frequency and quality of indirect connections offered by an airline by adopting a wave-system structure in the airline flight schedule. As an empirical analysis, it also calculated the minimum and maximum connection time adopting Korean Air's flight information.

Development of Continuous Indirect Connectivity Model for Evaluation of Hub Operations at Airport (공항의 허브화 평가를 위한 연속연결성지수모형 개발)

  • Lee, Sang-Yong;Yu, Gwang-Ui;Park, Yong-Hwa
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.4
    • /
    • pp.195-206
    • /
    • 2009
  • The deregulation of aviation markets in Europe and the United Sates had led airlines to reconfigure their networks into hub-and-spoke systems. Recent trends of "Open Skies" in the Asian aviation market are also expected to prompt the reformation of airlines' networks in the region. A significant connectivity index is a crucial tool for airlines and airport authorities to estimate the degree of hub-and-spoke operations. Therefore, this paper suggests a new index, Continuous Indirect Connectivity Index (CICI), for measuring the coordination of airlines' flight schedules, applying it to the Asian, European and the American aviation markets. CICI consists of three components:(i) temporal connectivity to identify the attractiveness between connection flights, (ii) spatial connectivity to differentiate the attractiveness by de-routing distance with continuous linear function, and (iii) relative intensity to reflect the effect of direct flight frequency on transfer routes. CICI is evaluated to examine a casual relationship through regression analyses with two dependent variables of the number of transfer passengers and transfer rates. Compared with Danesi's index and Doganis' index through evaluation processes, CICI has a higher coefficient value of determination, implying that it explains the relationship between connectivity and transfer passengers more precisely.

Railway Timetable Considering Optimal Path Finding Method in Rail Network (Focused on Revenue Allocation) (열차스케줄을 고려한 도시철도 이용객의 통행행태 추정 (수입금 정산사례를 중심으로))

  • Lee, Chang-Hun;Shin, Seong-Il;Kim, Si-Gon
    • Journal of the Korean Society for Railway
    • /
    • v.18 no.2
    • /
    • pp.149-156
    • /
    • 2015
  • It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

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.

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.

An Exploratory Development of Railway-timetable Rescheduling Model Considering Transferring Service between KTX and Conventional Train on a Double Line Track (KTX열차와 일반열차 간 접속대기를 고려한 복선구간 열차시각표 재수립 모형의 기본설계)

  • Kim, Jae-Hee;Oh, Seok-Moon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.6
    • /
    • pp.1337-1345
    • /
    • 2009
  • In the railway, the delay of a train may affect the schedule of other trains. Hence, the timetable management activity involving overtaking and transferring becomes an important issue. The timetable rescheduling is the conflict resolution of the disrupted schedule and a matter of deciding the sequence of moves among trains and the place for meeting. In Korea, there are few cases where operations research models were applied to railway timetable rescheduling problem in consideration of the transfer between Korea Train eXpress (KTX) trains and conventional trains. Hence, we present a mathematical approach that can minimize the total delay of the whole trains secondly. We applied the model to the exemplary section of a double-line track, the Gyung-Boo Line, and it is confirmed that the mathematical model could effectively address the transfer service as well as the complicated railway conflicts of Gyung-Boo Line.