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.
DOI
|
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.
DOI
|
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.
DOI
|
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.
DOI
|
6 |
Metchang, D. K. and Nemhausser, G. L. (1978b). Optimality Conditions for a dynamic Traffic assignment Model. Transportation Science. 12, pp. 200-207.
DOI
|
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.
DOI
|