• Title/Summary/Keyword: OD pair(Origin Destination Pair)

Search Result 6, Processing Time 0.028 seconds

Mathematical Modeling for Traffic Flow (교통흐름의 수학적 모형)

  • Lee, Seong-Cheol
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.1
    • /
    • pp.127-131
    • /
    • 2011
  • Even if there are no causing factors such as car crash and road works, traffic congestion come from traffic growth on the road. In this case, estimation of traffic flow helps find the solution of traffic congestion problem. In this paper, we present a optimization model which used on traffic equilibrium problem and studied the problem of inverting shortest path sets for complex traffic system. And we also develop pivotal decomposition algorithm for reliability function of complex traffic system. Several examples are illustrated.

Methods for a target-oriented travel demand management (목표지향 기종점 교통수요 관리모형연구)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.6
    • /
    • pp.167-176
    • /
    • 2009
  • Several travel demand management schemes have been used for controlling overloaded traffics on urban area. To maximize efficiency of the travel management, traffic manager has to set target level that we try to arrive in advance, and then to find optimal variable to attain this goal. In this regard, this paper presents two travel demand management models, expressed by mathematical program, and also presents their solution algorithms. The first is to find optimal travel demand for origin-destination (OD) pair, based on average travel time between the OD pair, and the second is based on the ratio of volume over capacity on congested area. An example is given to test the models.

A User Optimer Traffic Assignment Model Reflecting Route Perceived Cost (경로인지비용을 반영한 사용자최적통행배정모형)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.117-130
    • /
    • 2005
  • In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

A Green House Gas Emission Estimation Based on Gravity Model and Its Elasticity (중력모형을 이용한 온실가스 배출량추정 및 탄력성분석)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.4
    • /
    • pp.85-93
    • /
    • 2011
  • Many policies, such as transit-oriented development, encouraged use of bicycle and pedestrian, reduction of green house gas (GHG) and etc., have been deployed to support transport sustainability. Although various studies regarding GHG were presented, no one has yet adequately explained the behavior of travelers. This paper proposes a GHG emission model by highlighting its sensitivity, elasticity with regard to such travel cost as travel time, travel fare, and GHG pricing, introduced to reduce the amount of GHG in transportation system. For better estimation of GHG, the proposed model adopts (1) a production-constrained gravity model and (2) the travel distance from the origin and the destination (OD). The gravity model has a merit that it considers travel pattern between OD pairs. The model was tested with an example, and the promising results confirmed its validation and applications.

A Study on the Feeder Transit Route Design System (대중교통 지선노선 선정기법에 관한 연구)

  • 배기목
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2003.05a
    • /
    • pp.316-321
    • /
    • 2003
  • The bus as a feeder trip should supply equality service to the whole community. But in spite of the change of latent demand to the bus by the variety of regional structural change, the existing bus route can not supply effective feeder service. For cope with the latent demand to the bus, this study establish a concept that frame the feeder bus route design system for changing of the existing bus route or creating of bus route. The concept of feeder bus route design system from this study is not to frame the whole bus network but to frame the single route to a unit OD pair. So, this study have assumption that do not consider the wating time at bus stop and transfer time. This system is consist of three phase. First is limitation of examination road network, second is enumeration of a most suitable route, and final is determination of the optimum bus route. However, a precondition is that the necessary time from the origin to the destination is brief, and having many demand.

  • PDF

Estimation of Mass Rapid Transit Passenger's Train Choice Using a Mixture Distribution Analysis (통행시간 기반 혼합분포모형 분석을 통한 도시철도 승객의 급행 탑승 여부 추정 연구)

  • Jang, Jinwon;Yoon, Hosang;Park, Dongjoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.20 no.5
    • /
    • pp.1-17
    • /
    • 2021
  • Identifying the exact train and the type of train boarded by passengers is practically cumbersome. Previous studies identified the trains boarded by each passenger by matching the Automated Fare Collection (AFC) data and the train schedule diagram. However, this approach has been shown to be inefficient as the exact train boarded by a considerable number of passengers cannot be accurately determined. In this study, we demonstrate that the AFC data - diagram matching technique could not estimate 28% of the train type selected by passengers using the Seoul Metro line no.9. To obtain more accurate results, this paper developed a two-step method for estimating the train type boarded by passengers by applying the AFC data - diagram matching method followed by a mixture distribution analysis. As a result of the analysis, we derived reasonable express train use/non-use passenger classification points based on 298 origin-destination pairs that satisfied the verification criteria of this study.