• Title/Summary/Keyword: Dynamic Route Choice Condition

Search Result 5, Processing Time 0.024 seconds

An Equality-Based Model for Real-Time Application of A Dynamic Traffic Assignment Model (동적통행배정모형의 실시간 적용을 위한 변동등식의 응용)

  • Shin, Seong-Il;Ran, Bin;Choi, Dae-Soon;Baik, Nam-Tcheol
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.3
    • /
    • pp.129-147
    • /
    • 2002
  • This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

A Travel Time Prediction Model under Incidents (돌발상황하의 교통망 통행시간 예측모형)

  • Jang, Won-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.1
    • /
    • pp.71-79
    • /
    • 2011
  • Traditionally, a dynamic network model is considered as a tool for solving real-time traffic problems. One of useful and practical ways of using such models is to use it to produce and disseminate forecast travel time information so that the travelers can switch their routes from congested to less-congested or uncongested, which can enhance the performance of the network. This approach seems to be promising when the traffic congestion is severe, especially when sudden incidents happen. A consideration that should be given in implementing this method is that travel time information may affect the future traffic condition itself, creating undesirable side effects such as the over-reaction problem. Furthermore incorrect forecast travel time can make the information unreliable. In this paper, a network-wide travel time prediction model under incidents is developed. The model assumes that all drivers have access to detailed traffic information through personalized in-vehicle devices such as car navigation systems. Drivers are assumed to make their own travel choice based on the travel time information provided. A route-based stochastic variational inequality is formulated, which is used as a basic model for the travel time prediction. A diversion function is introduced to account for the motorists' willingness to divert. An inverse function of the diversion curve is derived to develop a variational inequality formulation for the travel time prediction model. Computational results illustrate the characteristics of the proposed model.

Dynamic Model Considering the Biases in SP Panel data (SP 패널데이터의 Bias를 고려한 동적모델)

  • 남궁문;성수련;최기주;이백진
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.6
    • /
    • pp.63-75
    • /
    • 2000
  • Stated Preference (SP) data has been regarded as more useful than Revealed Preference (RP) data, because researchers can investigate the respondents\` Preference and attitude for a traffic condition or a new traffic system by using the SP data. However, the SP data has two bias: the first one is the bias inherent in SP data and the latter one is the attrition bias in SP panel data. If the biases do not corrected, the choice model using SP data may predict a erroneous future demand. In this Paper, six route choice models are constructed to deal with the SP biases, and. these six models are classified into cross-sectional models (model I∼IH) and dynamic models (model IV∼VI) From the six models. some remarkable results are obtained. The cross-sectional model that incorporate RP choice results of responders with SP cross-sectional model can correct the biases inherent in SP data, and also the dynamic models can consider the temporal variations of the effectiveness of state dependence in SP responses by assuming a simple exponential function of the state dependence. WESML method that use the estimated attrition probability is also adopted to correct the attrition bias in SP Panel data. The results can be contributed to the dynamic modeling of SP Panel data and also useful to predict more exact demand.

  • PDF

Dynamic traffic assignment based on arrival time-based OD flows (도착시간 기준 기종점표를 이용한 동적통행배정)

  • Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.143-155
    • /
    • 2009
  • A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

Path-based Dynamic User Equilibrium Assignment Model using Simulation Loading Method (시뮬레이션 부하기법을 이용한 경로기반 동적통행배정모형의 개발)

  • 김현명;임용택;백승걸
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.3
    • /
    • pp.101-113
    • /
    • 2001
  • Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

  • PDF