-
3
-
-
0024163548
-
Optimal strategies and optimal routes in public transit assignment models: An empirical comparison
-
De Cea J., Bunster J.P., Zubieta L. and Florian M. (1988) Optimal strategies and optimal routes in public transit assignment models: an empirical comparison. Traffic Engineering and Control, 29, 520-526.
-
(1988)
Traffic Engineering and Control
, vol.29
, pp. 520-526
-
-
De Cea, J.1
Bunster, J.P.2
Zubieta, L.3
Florian, M.4
-
4
-
-
0024745293
-
Transit assignment to minimal routes: An efficient new algorithm
-
De Cea J. and Fernandez E. (1989) Transit assignment to minimal routes: an efficient new algorithm. Traffic Engineering and Control, 30, 491-494.
-
(1989)
Traffic Engineering and Control
, vol.30
, pp. 491-494
-
-
De Cea, J.1
Fernandez, E.2
-
5
-
-
0027601356
-
Transit assignment for congested public transport systems: An equilibrium model
-
De Cea J. and Fernandez E. (1993) Transit assignment for congested public transport systems: an equilibrium model. Transportation Science, 27, 133-147.
-
(1993)
Transportation Science
, vol.27
, pp. 133-147
-
-
De Cea, J.1
Fernandez, E.2
-
6
-
-
0015078345
-
A probabilistic multipath assignment model which obviates path enumeration
-
Dial R.B. (1971) A probabilistic multipath assignment model which obviates path enumeration. Transportation Research, 5, 83-111.
-
(1971)
Transportation Research
, vol.5
, pp. 83-111
-
-
Dial, R.B.1
-
7
-
-
34147120474
-
Note on two problems in connection with graphs (spanning tree, shortest path)
-
Dijkstra E.W. (1959) Note on two problems in connection with graphs (spanning tree, shortest path). Numerical Mathematics, 1, 269-271.
-
(1959)
Numerical Mathematics
, vol.1
, pp. 269-271
-
-
Dijkstra, E.W.1
-
11
-
-
0024650417
-
Optimal strategies: A new assignment model for transit networks
-
Spiess H. and Florian M. (1989) Optimal strategies: a new assignment model for transit networks. Transportation Research, 23B, 83-102.
-
(1989)
Transportation Research
, vol.23 B
, pp. 83-102
-
-
Spiess, H.1
Florian, M.2
-
12
-
-
0021449097
-
A computer model for finding the time-dependent minimum path in a transit system with fixed schedules
-
Tong C.O. and Richardson A. J. (1984) A computer model for finding the time-dependent minimum path in a transit system with fixed schedules. Journal of Advanced Transportation, 18, 145-161.
-
(1984)
Journal of Advanced Transportation
, vol.18
, pp. 145-161
-
-
Tong, C.O.1
Richardson, A.J.2
-
13
-
-
0006635128
-
-
Transport Department, Hong Kong Government
-
Wilbur Smith Associates (1989) Hong Kong Second Comprehensive Transport Study. Transport Department, Hong Kong Government.
-
(1989)
Hong Kong Second Comprehensive Transport Study
-
-
-
14
-
-
0343961776
-
Estimation of time-dependent origin-destination matrices for transit networks
-
in press
-
Wong S.C. and Tong C.O. (1996) Estimation of time-dependent origin-destination matrices for transit networks. Transportation Research Part B, in press.
-
(1996)
Transportation Research Part B
-
-
Wong, S.C.1
Tong, C.O.2
-
15
-
-
0000881715
-
Transit equilibrium assignment: A model and soluation algorithm
-
Wu J.H., Florian, M. and Marcotte P. (1994) Transit equilibrium assignment: a model and soluation algorithm. Transportation Science, 28(3), 193-20
-
(1994)
Transportation Science
, vol.28
, Issue.3
, pp. 193-220
-
-
Wu, J.H.1
Florian, M.2
Marcotte, P.3
|