Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks

References

• Ahuja R. K. , Magnanti T. L. , Orlin J. B. Networks Flows—Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Berge C. Hypergraphs: Combinatorics Of Finite Sets (1989) (North-Holland, Amsterdam) Google Scholar
• Cascetta E. , Nguyen S. A unified framework for estimating and updating trip matrices from traffic counts. Transportation Res. B (1988) 22 6 437 455 Crossref, Google Scholar
• Chriqui C. , Robillard P. Common bus line. Transportation Sci. (1975) 9 2 115 121 Link, Google Scholar
• Daganzo C. F. Multinomial Probit: The Theory and Its Application to Demand Forecasting (1979) (Academic Press, New York) Google Scholar
• Daganzo C. F. , Sheffi Y. On stochastic models of traffic assignment. Transportation Sci. (1977) 11 3 253 274 Link, Google Scholar
• Dial R. B. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Res. (1971) 5 83 111 Crossref, Google Scholar
• Dijkstra E. A note on two problems in connexion with graphs. Numer. Math. (1959) 1 269 271 Crossref, Google Scholar
• Dinic E. A. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. (1970) 11 5 1277 1280 Google Scholar
• Fisk C. S. , Nguyen S. Solution algorithm for network equilibrium models with asymmetric user costs. Transportation Sci. (1982) 16 3 361 381 Link, Google Scholar
• Florian M. , Florian M. An introduction to network models used in transportation planning. Transportation Planning Models (1984) (Elsevier Science Publishers B.V., North Holland, Amsterdam) 137 152 Google Scholar
• Gallo G. , Longo G. , Nguyen S. , Pallottino S. Directed hypergraphs and applications. Discrete Appl. Math. (1993) 42 2–3 177 201 Crossref, Google Scholar
• Gallo G. , Pallottino S. Shortest path methods: A unifying approach. Math. Program. Stud. (1986) 26 38 64 Crossref, Google Scholar
• Gendreau M. Une Étude approfondie d'un Modèle d'équilibre pour l'Affectation des Passagers dans les Réseaux de transport en Commun. (1984) . Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal Google Scholar
• Hasseltröm D. Public transportation planning—A mathematical programming approach. (1981) . Ph.D. dissertation, Department of Business Administration, University of Gothenburg, Sweden Google Scholar
• Jeroslow R. G. , Martin R. K. , Rardin R. L. , Wang J. Gainfree leontiev substitution problems. Math. Program. (1992) 57 3 375 414 Crossref, Google Scholar
• Lampkin W. , Saalmans P. D. The design of routes, service frequencies and schedules for a municipal bus undertaking: A case study. Oper. Res. Quart. (1967) 18 375 397 Crossref, Google Scholar
• Leclercq F. A public transport assignment method. Traffic Engrg. Control (1972) 14 91 96 Google Scholar
• Malhotra V. M. , Kumar M. P. , Maheshwari S. N. An O(∥V∥3) algorithm for finding maximum flows in networks. Inform. Process. Lett. (1978) 7 6 277 278 Crossref, Google Scholar
• Marguier P. H. J. , Ceder A. Passenger waiting strategies for overlapping bus routes. Transportation Sci. (1984) 18 3 207 230 Link, Google Scholar
• Nguyen S. , Florian M. A unified approach to equilibrium methods for traffic assignments. Traffic Equilibrium Methods (1976) 118 148 182 . Lecture Notes in Economics and Mathematical Systems Crossref, Google Scholar
• Nguyen S. , Pallottino S. Equilibrium traffic assignment for large scale transit network. Eur. J. Oper. Res. (1988) 37 2 176 186 Crossref, Google Scholar
• Nguyen S. , Pallottino S. , Simeone B. Hyperpaths and shortest hyperpaths. Combinatorial Optimization (1989) 1403 (Springer-Verlag, Berlin) 258 271 . Lecture Notes in Mathematics Crossref, Google Scholar
• Robillard P. Probabilistic multipath assignment model. Publication 112. (1973) . Département d'informatique et de recherche opérationnelle, Université de Montréal Google Scholar
• Spiess H. Contributions à la Théorie et aux Outils de planification des Réseaux de transport urbain. (1984) . Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal Google Scholar
• Spiess H. , Florian M. Optimal strategies: A new assignment model for transit networks. Transportation Res. B (1989) 23 2 83 102 Crossref, Google Scholar
• Trahan M. Probabilistic assignment: An algorithm. Transportation Sci. (1974) 8 4 311 320 Link, Google Scholar
• Wu J. H. Monotone variational inequality problem study and its application to transportation network equilibrium problem. (1991) . Ph.D. dissertation, Département d'informatique et de recherche opérationnelle, Université de Montréal Google Scholar