Stochastic assignment to high frequency transit networks: models, algorithms, and applications with different perceived cost distributions

  • Giulio Erberto Cantarella
  • Antonino Vitetta
Part of the Applied Optimization book series (APOP, volume 48)


In urban areas transportation demand is commonly served both by private cars and mass transit systems (bus, tram, metro, etc.), which are usually based on a network of partially competing and overlapping lines. Therefore, user pre-trip path choice behaviour in transit systemsrefers to overall strategies that specify which line will be boarded at each bus stop (more generally how the user will behave at diversion nodes). The topology of user strategies are effectively modelled by hyperpaths (introduced by Nguyen and Pallottino, 1988). The pre-trip choice among hyperpaths (say strategies) is currently simulated through a deterministic choice model. This assumption leads to deterministic network loading or user equilibrium assignment for uncongested or congested network respectively. In this paper the pre-trip choice among hyperpaths is simulated through probabilistic choice models derived from random utility theory. Resulting stochastic network loading and user equilibrium models are analysed as well as solution algorithms. Results of an application to a test system and a real one are also reported, using different perceived cost distribution.


Transit Assignment Stochastic assignment 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Abramowiz M., Stegun I. (1970), Handbook of Mathematical Functions with Formulas, Graphs and Matematical Tables“, Dover Publications Inc. New York.Google Scholar
  2. Ben Akiva M. and Lerman S. R. (1987). Discrete Choice Analysis. MIT Press, Cambridge MA.Google Scholar
  3. Bouzaiene-Ayari B., Gendreau M., Nguyen S. (1995), “On the Modelling of Bus Stops in Transit Networks”, Centre de recherche sur les transports, Université de Montréal.Google Scholar
  4. Bouzaiene-Ayari B., Gendreau M., Nguyen S. (1997), “Transit Equilibrium assignment Problem: A Fixed-Point Simplicial -Decomposition Solution Algorithm”, Operations Research.Google Scholar
  5. Burrell J.E. (1968), “Multiple route assignment and its application to capacity restraint”, In Proceedings o the 4t International Symposium on the Theory of Road Traffic Flow, W. Leutzbach and P. Baron eds.. Karlsruhe, GermanyGoogle Scholar
  6. Cantarella G. E., Cascetta E. (1995), “Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory”, Trans. Science 31, 107–128.CrossRefGoogle Scholar
  7. Cantarella, G.E. (1997), “A General Fixed Point Approach to Multi-mode Multi-user Equilibrium Assignment with Elastic Demand enumeration”, Trans. Science.Google Scholar
  8. Cantarella G.E., Binetti M (2000). Stochastic Assignment with Gamma Distributed Perceived Costs. Proceedings of the 6`h Meeting of the EURO Working Group on Transportation. Gothenburg, Sweden, September 1998, forthcoming.Google Scholar
  9. Caroti Ghelli F. (1978), Statistica Bayesiana,ed. Franco Angeli.Google Scholar
  10. Cascetta E. (1998), Ingegneria dei Sistemi di Trasporto,UTET.Google Scholar
  11. Daganzo C. F., Sheffi Y. (1977), “On Stochastic Models of Traffic Assignment”, Trans. Science.Google Scholar
  12. Daganzo C. F., Sheffi Y. (1983), “Stochastic Network Equilibrium with Multiple Vehicle types and Asimmetric, indefinite Link Cost Jacobians ”, Trans. Science 18, 282–300.CrossRefGoogle Scholar
  13. Dial R.B. (1971), “A Probabilistic Multipath Traffic Assignment Model with Obiviates Path Enumeration”, Trans. Research.Google Scholar
  14. Fisk C. (1980), “Some Developments In Equilibrium Traffic Assignment Methodology”, Trans. Research.Google Scholar
  15. Nguyen S., Pallottino (1988), “Equilibrium Traffic Assignment for Large Scale Transit Networks”, EJOR.Google Scholar
  16. Nielsen O. A. (1997), “On The Distributions Of The Stochastic Components In SUE Traffic Assignment Models”, In Proceedings of 25th European Transport Forum Annual Meeting, Seminar F On Transportation Planning Methods, Volume I I.Google Scholar
  17. Patriksson M. (1994), The traffic assignment problem: models and methods“, VNU Science Press, UTRECHT The Netherlands.Google Scholar
  18. Sheffi Y. (1985), Urban Transportation Networks, Prentice-Hall, Englewood Cliffs, New York.Google Scholar
  19. Sheffi Y., Powell W. B. (1982), “An Algorithm For The Equilibrium Assignment Problem With Random Link Times”, Networks 12.Google Scholar
  20. Spiess H. (1984), “Contribution à la théorie et aux outils de planification des réseaux de transport urban”, Département d’Informatique et de Recherche Opérationnelle, Université de Montréal.Google Scholar
  21. Wardrop J. G. (1952), “Some Theoretical Aspects of Road Traffic Research”, Proc. Inst. Civil Engr. Part I I.Google Scholar
  22. Wu J. H., Florian M. (1993), “A Simplicial Decomposition Method for the Transit Equilibrium Assignment Problem”, Annals of Operations Research.Google Scholar
  23. Wu J. H., Florian M., Marcotte P. (1994), “Transit Equilibrium Assignment: A Model and Solution Algorithms”, Trans. Science.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Giulio Erberto Cantarella
    • 1
  • Antonino Vitetta
    • 2
  1. 1.Dept. Of Civil EngineeringUniversity of SalernoFisciano (SA)Italy
  2. 2.Dept. of Comp.Sci., Math., Electr., and TransportationUniversity of Reggio CalabriaReggio CalabriaItaly

Personalised recommendations