A Modeling Framework for Passenger Assignment on a Transport Network with Timetables

References

• Alfa A. S. A review of models for the temporal distribution of peak traffic demand. Transportation Res. (1986) 20B(6):491–499Crossref, Google Scholar
• Alfa A. S. Departure rate and route assignment of commuter traffic during peak period. Transportation Res. (1989) 23B(5):337–344Crossref, Google Scholar
• Arezki Y D. Van Vliet. A full analytical implementation of the PARTAN/Frank-Wolfe algorithm for equilibrium assignment. Transportation Sci. (1990) 24(1):58–62Link, Google Scholar
• Carey M. Nonconvexity of the dynamic traffic assignment problem. Transportation Res. (1992) 26B(2):127–133Crossref, Google Scholar
• Carey M., Srinivasan A. Congested network flows: Time-varying demands and start-time policies. Eur. J. Oper. Res. (1988) 36(2):227–240Crossref, Google Scholar
• Dafermos S. Traffic equilibria and variational inequalities. Transportation Sci. (1980) 14(1):42–54Link, Google Scholar
• De Palma A., Ben-Akiva M., Lefevre C., Litinas N. Stochastic equilibrium model of peak period traffic congestion. Transportation Sci. (1983) 17(3):430–453Link, Google Scholar
• Fisk C. S., Nguyen S. Solution algorithm for network equilibrium models with asymmetric user costs. Transportation Sci. (1982) 16(3):361–381Link, Google Scholar
• Florian M., Guélat J., Spiess H. An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem. Networks (1987) 17(3):319–339Crossref, Google Scholar
• Friesz T. L., Bernstein D., Smith T. E., Tobin R. L., Wie B. W. A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. (1993) 41(1):179–191Link, Google Scholar
• Friesz T. L., Luque F. J., Tobin R. L., Wie B. W. Dynamic network traffic assignment considered as a continuous time optimal control problem. Oper. Res. (1989) 37(6):893–901Link, Google Scholar
• Gallo G., Pallottino S. Shortest path methods: A unifying approach. Math. Programming Stud. (1986) 26:38–64Crossref, 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) (Département d'informatique et de recherche opérationnelle, Université de Montréal, Montreal, Canada) . Ph.D. thesisGoogle Scholar
• Hearn D. W. Bounding flows in traffic assignment models. (1980) (University of Florida, Gainesville, FL) . Research Report 80-4, Department of Industrial and Systems EngineeringGoogle Scholar
• Hearn D. W., Lawphongpanich S., Nguyen S. Convex programming formulations of the asymmetric traffic assignment problem. Transportation Res. (1984) 18B(4):357–365Crossref, Google Scholar
• Hearn D. W., Lawphongpanich S., Ventura J. A. Finiteness in restricted simplicial decomposition. Oper. Res. Lett. (1985) 4:125–130Crossref, Google Scholar
• Hearn D. W., Lawphongpanich S., Ventura J. A. Restricted simplicial decomposition: computation and extensions. Math. Programming Stud. (1987) 31:99–118Crossref, Google Scholar
• Hendrickson C., Plank E. The flexibility of departure times for work trips. Transportation Res. (1984) 18A(1):25–36Crossref, Google Scholar
• Kinderlehrer D., Stampacchia G.An Introduction to Variational Inequalities and Applications (1980) (Academic Press, New York) Google Scholar
• Larsson T., Patriksson M. Simplicial decomposition with dis-aggregated representation for the traffic assignment problem. Transportation Sci. (1992) 26(1):4–17Link, Google Scholar
• Leblanc L. J., Helgason R. V., Boyce D. E. Improved efficiency of the Frank-Wolfe algorithm. Transportation Sci. (1985) 19(4):445–462Link, Google Scholar
• Luenberger D. G.Introduction to Linear and Nonlinear Programming (1984) (Addison-Wesley, Reading, MA) Google Scholar
• Mahmassani H. S., Chang G. L. Dynamic aspect of departure-time choice behaviour in a commuting system: Theoretical framework and experimental analysis. Transportation Res. Record (1986) 1037:88–101Google Scholar
• Mahmassani H. S., Chang G. L. On boundedly rational user equilibrium in transportation systems. Transportation Sci. (1987) 21(2):89–99Link, Google Scholar
• Mahmassani H. S., Herman R. Dynamic user equilibrium departure time and route choice on idealized traffic arterials. Transportation Sci. (1984) 18(4):362–384Link, Google Scholar
• Marcotte P., Nguyen S., Marcotte P., Nguyen S. Hyperpath formulations of traffic assignment problems. Equilibrium and Advanced Transportation Modelling (1998) (Kluwer Academic Publisher, Assinipi Park, Norwell, MA) 175–199Crossref, Google Scholar
• Mondou J. F., Crainic G. T., Nguyen S. Shortest path algorithms: A computational study with the C programming language. Comput. Oper. Res. (1991) 18(8):767–786Crossref, Google Scholar
• Newell G. F. The morning commute for nonidentical travellers. Transportation Sci. (1987) 21(2):74–88Link, Google Scholar
• Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. (1988) 37(2):176–186Crossref, Google Scholar
• Pallottino S., Scutellà M. G., Marcotte P., Nguyen S. Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and Advanced Transportation Modelling (1998) (Kluwer Academic Publisher, Assinipi Park, Norwell, MA) 245–281Crossref, Google Scholar
• Patriksson M.The Traffic Assignment Problem: Models and Methods (1994) (VSP, Utrecht, The Netherlands) Google Scholar
• Smith M. J. The existence, uniqueness and stability of traffic equilibria. Transportation Res. (1979) 13B(4):295–304Crossref, Google Scholar
• Smith M. J. An algorithm for solving asymmertic equilibrium problems with a continuous cost-flow function. Transportation Res. (1983a) 17B(5):365–371Crossref, Google Scholar
• Smith M. J. The existence and calculation of traffic equilibria. Transportation Res. (1983b) 17B(4):291–303Crossref, Google Scholar
• Spiess H., Florian M. Optimal strategies: A new assignment model for transit networks. Transportation Res. (1989) 23B(2):83–102Crossref, Google Scholar
• Sumi T., Matsumoto Y., Miyaki Y. Departure time and route choice of commuters on mass transit systems. Transportation Res. (1990) 24B(4):247–262Crossref, Google Scholar
• Von Hohenbalken B. Simplicial decomposition in nonlinear programming algorithms. Math. Programming (1977) 13:49–68Crossref, Google Scholar
• Wardrop J. G. Some theoretical aspects of road traffic research. Proc. of the Institute of Civil Engineers (1952) 325–378Part 2, No. 1Crossref, Google Scholar
• Wu J. H., Florian M., Marcotte P. Transit equilibrium assignment: A model and solution algorithms. Transportation Sci. (1994) 28(3):193–203Link, Google Scholar