Least-cost path in public transportation systems with fare rebates that are path- And time-dependent

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn , Issue , 2004, Pages 1000-1005

  Tan, Jinsong ^a   Leon, Hon Wai ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUTERS; SERVICE LINE; TRANSPORTATION SYSTEMS;

COSTS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

TRANSPORTATION;

EID: 13344280958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Tan, On Path-dependent Shortest Path and Its Application in Finding Least Cost Path in Transportation Networks, Master Thesis, School of Computing, National University of Singapore (2003).
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, (1993).
3. Caldwell T. On finding minimal routes in a network with turning penalties. Comm. ACM, Vol.4 (1961) 107-108.
4. J. Anez, T. De La Barra and B. Ferez, Dual graph representation of transport networks, Trans. Res. B, Vol. 30, No. 3 (1996) 209-216.
5. A. K. Ziliaskopoulos and H. S. Mahmassani, A note on least time path computation considering delays and prohibitions for intersection movements, Transportation Research B, Vol. 30, No. 5 (1996) 359-367.
6. Kirby R. F. and Potts R. B., The minimum route problem for networks with turn penalties and prohibitions, Trans. Res. Vol. 3 (1969) 397-408.
7. Pallottino S. and M. G. Scutellà, "Shortest path algorithms in transportation models: classical and innovative aspects", in (P. Marcotte and S. Nguyen, eds.) Equilibrium and Advanced Transportation Modeling, Kluwer, (1998) 245-281.
8. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In LATIN (2000) 88-94.
9. H. N. Gabow, J. L. Bentley and R. E. Tarjan. Scaling and related techniques for geometry problems. In SODA (1984) 135-143.
10. H. Mongelli and S. W. Song, A range minima parallel algorithm for coarse grained multicomputers. In IPPS/SPDP Workshops (1999) 1075-1084.
11. J. Vuillemin, A unifiying look at data structures. Comm. of the ACM, 23:229-239, (1980).
12. R. Cole and R. Hariharan, Dynamic LCA Queries on Trees". SODA (1999), 235-244.
13. Y. Lao, Multi-Modal Route Planning in Public Land Transportation. Bachelor Thesis, School of Computing, National University of Singapore (1999).