Implicit enumeration of hyperpaths in a logit model for transit networks

Transportation Science

Volumn 32, Issue 1, 1998, Pages 54-64

  Nguyen, Sang ^a   Pallottino, Stefano ^b   Gendreau, Michel ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BUS TRANSPORTATION; HIGHWAY SYSTEMS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; RANDOM PROCESSES;

BUS STOP; HYPERPATH; LOGIT MODEL; PASSENGER ASSIGNMENT MODEL; STOCHASTIC ASSIGNMENT MODEL; URBAN TRANSIT NETWORK;

MASS TRANSPORTATION;

EID: 0031998314     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.32.1.54     Document Type: Article

References (28)

1. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN, Networks Flows - Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. BERGE, C., Hypergraphs: Combinatorics Of Finite Sets, North-Holland, Amsterdam, 1989.
3. CASCETTA, E. AND S. NGUYEN, "A Unified Framework for Estimating and Updating Trip Matrices from Traffic Counts," Transp. Res. B 22(6), 437-455, 1988.
4. CHRIQUI, C. AND P. ROBILIARD, "Common Bus Line," Transp. Sci. 9(2), 115-121, 1975.
5. DAGANZO, C. F., Multinomial Probit: The Theory and Its Application to Demand Forecasting, Academic Press, New York, 1979.
6. DAGANZO, C. F. AND Y. SHEFFI, "On Stochastic Models of Traffic Assignment," Transp. Sci. 11(3), 253-274, 1977.
7. DIAL, R. B., "A Probabilistic Multipath Traffic Assignment. Model which Obviates Path Enumeration," Transp. Res. 5, 83-111, 1971.
8. DIJKSTRA, E., "A Note on Two Problems in Connexion with Graphs," Numer. Math. 1, 269-271, 1959.
9. DINIC, E. A., "Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation," Soviet Math. Dokl. 11(5), 1277-1280, 1970.
10. FISK, C. S. AND S. NGUYEN, "Solution Algorithm for Network Equilibrium Models with Asymmetric User Costs," Transp. Sci. 16(3), 361-381, 1982.
11. FLORIAN, M., "An Introduction to Network Models used in Transportation Planning," in Transportation Planning Models, M. Florian (ed.) Elsevier Science Publishers B.V. (North Holland), Amsterdam, 137-152, 1984.
12. GALLO, G., G. LONGO, S. NGUYEN, AND S. PALLOTTINO, "Directed Hypergraphs and Applications," Discrete Appl. Math. 42(2-3), 177-201, 1993.
13. GALLO, G. AND S. PALLOTTINO, "Shortest Path Methods: A Unifying Approach," Math. Program. Stud. 26, 38-64, 1986.
14. GENDREAU, M., Une Étude approfondie d'un Modèle d'équilibre pour l'Affectation des Passagers dans les Réseaux de transport en Commun. Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 1984.
15. HASSELTRÖM, D., Public Transportation Planning - A Mathematical Programming Approach. Ph.D. dissertation, Department of Business Administration, University of Gothenburg, Sweden, 1981.
16. JEROSLOW, R. G., R. K. MARTIN, R. L. RARDIN, AND J. WANG, "Gainfree Leontiev Substitution Problems," Math. Program. 57(3), 375-414, 1992.
17. LAMPKIN, W. AND P. D. SAALMANS, "The Design of Routes, Service Frequencies and Schedules for a Municipal Bus Undertaking: A Case Study." Operational Res. Quart. 18, 375-397, 1967.
18. LECLERCQ, F., "A Public Transport Assignment Method," Traffic Eng. Control. 14, 91-96, 1972.
19. 3) Algorithm for Finding Maximum Flows in Networks." Inform. Process. Lett. 7(6), 277-278, 1978.
20. MARGUIER, P. H. J. AND A. CEDER, "Passenger Waiting Strategies for Overlapping Bus Routes," Transp. Sci. 18(3), 207-230, 1984.
21. NGUTEN, S., "A Unified Approach to Equilibrium Methods for Traffic Assignments," in Traffic Equilibrium Methods, M. Florian (ed.), volume 118 Lecture Notes in Economics and Mathematical Systems, 148-182, 1976.
22. NGUYEN, S. AND S. PALLOTTINO, "Equilibrium Traffic Assignment for Large Scale Transit Network," Eur. J. Operational Res. 37(2), 176-186, 1988.
23. NGUYEN, S. AND S. PALLOTTINO, "Hyperpaths and Shortest Hyperpaths," In Combinatorial Optimization, B. Simeone (ed.), volume 1403 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 258-271, 1989.
24. ROBILLARD, P., Probabilistic Multipath Assignment Model, Publication 112, Département d'informatique et de recherche opérationnelle, Université de Montréal, 1973.
25. SPIESS, H., Contributions à la Théorie et aux Outils de planification des Réseaux de transport urbain. Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 1984.
26. SPIESS, H. AND M. FLORIAN, "Optimal Strategies: A New Assignment Model for Transit Networks," Transp. Res. B. 23(2), 83-102, 1989.
27. TRAHAN, M., "Probabilistic Assignment: An Algorithm." Transp. Sci. 8(4), 311-320, 1974.
28. Wu, J. H., Monotone Variational Inequality Problem Study and Its Application to Transportation Network Equilibrium Problem. Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal, 1991.