• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.31-40
• /
• 1998

본 연구의 목적은 기존의 Cell Transmission(1994, Daganzo) 교통류 이론을 기반으로 동적통행배정 모형을 개발하는 것이다. 이 모형은 동적 O-D 발생모듈, HOV 차선모듈, 분류부 분할모델, 링크비용함수 모듈, 최단경로 탐색 모듈등으로 구성된다. 이 모델에서 적용하는 교통류 모델은 각 링크를 동일한 특성을 가지는 셀로 구분하여 셀내의 진입시간과 진출시간을 계산하여 링크비용을 계산하는데 이것은 비용의 과대·과소 추정을 피할 수 있으며 교통지체 현상을 현실적으로 표현해 줄 수 있는 장점이 있다. 또한 HOV 차선 모듈에 의해 수단별 교통류 진행 및 비용고려가 가능하며 HOV 차선의 평가 및 분석이 가능하다. 기존의 동적통행배정모형은 매 시간대별 출발지에서 균형상태를 추구하는 통행배정기법을 사용하고 있지만 이 모델은 분류되는 노드를 가상의 출발점이라고 가정하여 각 시간대별로 최단경로를 탐색하여 균형상태를 추구해나가는 기법을 적용하고 있다. 각 셀별 차량을 목적지별, 차종별, 대기시간별로 추적하여 진행시키며 분류부에서는 최단경로를 탐색하여 배분된다. 또한 진행하고자 하는 셀의 용량과 현재 셀의 밀도를 고려함으로서 용량제약 하에서의 동적통행배정모형을 적용하고 있다. 이 모형은 고속로의 합류부 및 분류부의 교통특성을 세밀히 분석할 수 있으며, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으며, 고속도로 중·장기적인 계획에 이용될 수 있다.

• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.570-579
• /
• 2016

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

• 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.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.65-75
• /
• 2003

In these days, public transportation has become important because of serious traffic congestion. But. there are few researches in public transportation compared with researches in auto. Accordingly, the purpose of paper is development of transit assignment model, which considers features of public transportation, time table, transfer capacity of vehicle, common line, etc. The transit assignment model developed in this paper is composed of two parts. One part is search for optimum path, the other part is network loading. A Genetic algorithm has been developed in order to search for alternative shortest path set. After the shortest paths have been obtained in the genetic algorithm, Logit-base stochastic loading model has been used to obtain the assigned volumes.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.31-45
• /
• 2015

Existing link-based Frank-Wolfe algorithm has been widely used, thanks to its ease of simulation and stable results; however, it comes with low convergence issue towards near the optimum value. Such issue was not considered as a major drawback in the past. However, in the present, some arguments have occurred over the method's stability, analysis time, and other limits as the size and details of the fundamental data for traffic analysis have vastly improved. Therefore, this paper compared the theoretical attributes and the pros and cons between the Frank-Wolfe algorithm and the Origin-based algorithm and Path-based algorithm newly being developed. As a result of this paper, there is possibility that a problem of stability may arise depending on the convergence and exit criteria. Thus, In practice, this effort to derive the appropriate level of convergence is required to secure and stable results.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.35-41
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.77-88
• /
• 2003

This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.97-108
• /
• 2001

A dynamic transportation management should be applied specially in AM peak because AM peak is more critical than PM peak in traffic volume and demand. AM peak trip can be characterized by commuting and schooling. which have the high level of usage on public transportation, and constraint on arrival time. So transportation management applied in AM peak could deal with a mode choice and an arrival time constrain. Researchers were involved in the dynamic transportation assignment models for management of congested traffic network. But, there were no models which considered a mode choice and an arrival time constrain should be included in management of AM peak. So there are limits to use exist models to control and analyze AM peak traffic. In this study, it is proposed the combined dynamic transportation model, considering a mode choice and the start time selection with arrival time constrains, based on Ran and Boyce's model. The proposed model is verified the compatibility by applying to the newly designed time space expanded network. The result shows that proposed model consistent with dynamic user optimal travel pattern. From this we certificate the applicability of the proposed model to control and analyze AM peak traffic.