Browse > Article

The Development of Predictive Multiclass Dynamic Traffic Assignment Model and Algorithm  

Kang, Jin-Gu (벽산엔지니어링)
Park, Jin-Hee (건국대학교 지리학과)
Lee, Young-Ihn (서울대학교 환경대학원)
Won, Jai-Mu (한양대학교 도시대학원)
Ryu, Si-Kyun (경기개발연구원)
Publication Information
Journal of Korean Society of Transportation / v.22, no.5, 2004 , pp. 123-137 More about this Journal
Abstract
The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.
Keywords
예측적 통행비용;다중계층 통행배분모형;수직적 대기행렬;동적 네트워크부하;MSA;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 B. G. Heydecker and J. D. Addison. 1996. ‘An exact expression of dynamic traffic equlibrium’. In: Transportation and Traffic Theory (ed. J-B Lesort). Oxford:Pergomon. pp.359-383
2 B. G. Heydecker and N. Verlander. 1999. 'Calculation of dynamic traffic equilibrium assignment'. Proceeding of the European Tranport Conferences. Seminar F. p.434
3 B. N. Janson, 1991, 'Dynamic traffic assignment for urban road networks'. Transpotation Research, 25B(2/3), PP.143-161
4 Papageorgiou. 1990. 'Dynamic modelling. assignment. and route guidance in traffic networks'. Transpotation Research. 24B(6), pp.471-495
5 T.L. Friesz, Bernstein. D., Smith. T.E., Tobin. R.L., and Wie , B., 1989. (1993) 'A variational inequality formulation of the dymanic networks user equalibrium problem', Operation Research. 41(1). pp.179-191   DOI   ScienceOn
6 W. H. Lin, and H. K. Lo, 2000. 'Are the object and solution of dynamic user equilibrium models always consistent?'. Transpotation Research, 34A, pp.137-144
7 E. D. Romph, 1994, 'A dynamic traffic assignment model; Theory and Application'. PhD thesis. Delft University of Technology
8 D. K. 1978, 'Merchant and G.L. Nemhauser. A model and an algorithm for the dynamic traffic assignment problem'. Transportation Science. 12(3), pp.183-199   DOI   ScienceOn
9 임강원(2002). '통적 통행배정모형을 위한 교통류부 하모형의 개발', 대한교통학회. 제20권 제3호, 대한교통학회. pp.149-158
10 B. G. Heydecker. and J. D. Addison, 1999. 'Dynamic traffic equilibrium with departure time choice'. In: Transportation and Traffic Theory(ed A Ceder). Haifa, Israel: Transpotation Research, Institute, pp.287 -316
11 S. Han, 2000. ‘Dynamic Traffic Assignment Techniques for General Road Networks’. PhD. thesis. University College of London
12 한상진 (2002). '동적 네트워크 로딩방법 및 적용에 관한 연구', 대한교통학회, 제20권 제1호, 대한교통학회. pp.101-110
13 C. Buisson. J.P. Lebacque and J. B. Lesort, 1998. ‘Travel times computation for dynamic assignment modelling’. In: Tranportation networks Recent methodological advances (ed. Bell, M.G.H. ), Pergomon, pp.303-317
14 L. M. Wynter, 1995, 'Advances in the theory and application of the multiclass traffic assignment problem'. PH.D. thesis, Dept. Transport. ECOLE NATIONALE DES POINT ET CHAUSSEES. pp.161-207
15 R. Jayakrishnan, W. K. Tsai, and A. Chen, 1995. 'A dynamic traffic assignment model with traffic-flow relationships'. Transportation Research. 3C(1), pp.51-72
16 Bin Ran, David Boyce, 1996, Modeling Dynamic Transportation Networks. Springer
17 M. Kuwahara, and T. Akamatsu. 1997, 'Decomposition of the reactive dynamic assignment with queues for a many-to-many origin-destination pattern', Transportation Research. 31B(1). pp.1-10
18 V. A. Astarita, 1996. 'Continuous time link model for dynamic network losading based travel time functions', In; Transportation and Traffic Theory(ed. J-B Lesort). Oxford : Pergamon. pp.179-102
19 C. Meneguzzer. 1995. 'Computational Experiments with a Combined Route Choice and Intersection Control Model with Asymmetric Cost Functions'. paper presented at the 4th Int I. Conf. on Applie. od Adv. Technol. to Transp.Eng., Italy
20 G. L. Chang. and X. Tao. 1996. 'Estimation of dynamic O-D distributions for urban networks'. Proceedings of the 13th International Symposium on Transpotation and Traffic Theory, Pergomon. pp.1-20