JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Development of Dynamic Passenger-Trip Assignment Model of Urban Railway Using Seoul-Incheon-Gyeonggi`s Transportation Card
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Development of Dynamic Passenger-Trip Assignment Model of Urban Railway Using Seoul-Incheon-Gyeonggi`s Transportation Card
Sohn, Jhieon;
  PDF(new window)
 Abstract
With approximately 20 million transportation card data entries of the metropolitan districts being generated per day, application of the data to management and policy interventions is becoming an issue of interest. The research herein attempts a model of the possibility of dynamic demand change predictions and its purpose is thereby to construct a Dynamic Passengers Trip Assignment Model. The model and algorithm created are targeted at city rail lines operated by seven different transport facilities with the exclusion of travel by bus, as passenger movements by this mode can be minutely disaggregated through card tagging. The model created has been constructed in continuous time as is fitting to the big data characteristic of transport card data, while passenger path choice behavior is effectively represented using a perception parameter as a function of increasing number of transfers. Running the model on 800 pairs of metropolitan city rail data has proven its capability in determining dynamic demand at any moment in time, in line with the typical advantages expected of a continuous time-based model. Comparison against data measured by the eye of existing rail operating facilities to assess changes in congestion intensity shows that the model closely approximates the values and trends of the existing data with high levels of confidence. Future research efforts should be directed toward continued examination into construction of an integrated bus-city rail system model.
 Keywords
Public transportation card;Dynamic;Trip assignment model;Big data;Seoul-incheon-gyeonggi;
 Language
Korean
 Cited by
 References
1.
Azevedo, J. A., Costa, M. E. O. S., Madeira, J. J. E. R. S. and Martins, E. Q. V. (1993). "An algorithm for the ranking of shortest paths." European Journal of Operational Research, Vol. 69, No. 1, pp. 97-106. crossref(new window)

2.
Carey, M. (1992) Nonconvexity of the Dynamic Traffic Assignment Problem. Transportation Research. 26B, pp. 127-133.

3.
Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W. (1993). A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operation. Operations Research. 41, pp. 179-191. crossref(new window)

4.
Friesz, T. L., Luque, F. J., Tobin, R. L. and Wie, B. W. (1989). Dynamic Network Traffic Assignment Considered As A Continuous Time Optimal Control Problem. Operations Research. 37, pp. 893-901. crossref(new window)

5.
Metchang, D. K. and Nemhausser, G. L. (1978a). A Model and An Algorithm for the Dynamic Traffic Assignment Problems. Transportation Science. 12, pp. 183-199. crossref(new window)

6.
Metchang, D. K. and Nemhausser, G. L. (1978b). Optimality Conditions for a dynamic Traffic assignment Model. Transportation Science. 12, pp. 200-207. crossref(new window)

7.
Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V. and Mishchenko, E. F. (1962). The Mathematical Theory of Optimal Processes. English translation. Interscience. ISBN 2-88124-077-1.

8.
Ran, B. and Boyce, D. E. (1996). Modeling Dynamic Transportation Networks. Springer.

9.
Spiess, H. and Florian, M. (1999). "Optimal Strategies : A New Assignment Model for Transit Networks." Transportation Research B, Vol. 3, No. 2, pp. 83-102.

10.
Wie, B. W., Friesz, T. L. and Tobin, R. L. (1990). "Dynamic user optimal traffic assignment on congested multidestination Networks." Transportation Research, 24B, pp. 443-451.

11.
Wie, B. W., Tobin, R. L., Friesz, T. L. and Bernstein, D. (1995). "A discrete time, Nested cost operator approach to the dynamic network user equilibrium problem." Transportation Science, Vol. 29, No. 1, pp. 79-92. crossref(new window)