Applications and Future Developments: Modelling the Diversity and Integration of Transit Modes

  • Ingmar Andreasson
  • Fabien LeurentEmail author
  • Francesco Corman
  • Luigi dell’Olio
Part of the Springer Tracts on Transportation and Traffic book series (STTT)


Passenger transit modes typical of the urban setting, including bus, tram, metro, and train, have been described in Chap.  2, along with less conventional modes such as BRT and cable. Then, Chaps.  6 and  7 have provided network assignment models that address primarily the passenger side, dealing with route choice situations and behaviour, the individual exposure to traffic conditions, and the contribution of individual users to local flows. In these models, the transit mode is represented as a set of lines, each of which is abstracted into its topology (nodes and links) and some features of traffic operations: run time, dwell time, and some capacity parameters. In such an abstract setting, no distinction has been made between, for instance, bus and railway services, apart from their respective parameter values.


Travel Salesman Problem Vehicle Rout Problem Route Choice Transit Network Passenger Flow 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Abbink EJW, Van den Berg BWV, Kroon LG, Salomon M (2004) Allocation of Railway Rolling Stock for Passenger Trains. Transp Sci 38:33–42CrossRefGoogle Scholar
  2. Abdelghany KF, Mahmassani HS (2001) Dynamic trip assignment-simulation model for intermodal transportation networks. Transp Res Board 1771:52–60CrossRefGoogle Scholar
  3. Almodovar M, García-Rodenas R (2013) On-line reschedule optimization for passenger railways in case of emergencies. Comput Oper Res 40:725–736CrossRefGoogle Scholar
  4. Anderson JE (1998) Control of personal rapid transit systems. J Adv Transp 32:57–74CrossRefGoogle Scholar
  5. Andreasson I (1994) Vehicle distribution in large personal rapid transit systems. Transp Res Board 1451:95–99Google Scholar
  6. Andreasson I (2003) Reallocation of empty personal rapid transit vehicles en route. Transp Res Board 1838:36–41CrossRefGoogle Scholar
  7. Andreasson I (2005) Ride-sharing on PRT. Proceedings of the 10th APM conference in Orlando, American Society of Civil Engineers, USAGoogle Scholar
  8. Andreasson I (2009) Extending PRT capabilities. In: Proceedings of the 12th APM conference in Atlanta, American Society of Civil Engineers, USAGoogle Scholar
  9. Andreasson I (2014) Private communication on PRTsim modelGoogle Scholar
  10. Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30:377–387CrossRefGoogle Scholar
  11. Bell MGH, Wong KI (2005) A rolling horizon approach to the optimal dispatching of taxis. In: Mahmassani HS (ed) Transportation and traffic theory: flow, dynamics and human interaction. Elsevier, OxfordGoogle Scholar
  12. Bellei G, Gentile G, Papola N (2000) Transit assignment with variable frequencies and congestion effects. In: Proceedings of the 8th Meeting of the EURO Working Group on Transportation—EWGT 2000, Roma, Italy, pp 525–532Google Scholar
  13. Cats O (2014) Regularity-driven bus operations: principles, implementation and business models. Transp Policy 36:223–230CrossRefGoogle Scholar
  14. Cats O, Burghout W, Toledo T, Koutsopoulos HN (2010) Mesoscopic modeling of bus public transportation. Transp Res Rec 2188:9–18CrossRefGoogle Scholar
  15. Cats O, Larijani AN, Burghout W, Koutsopoulos HN (2011) Impacts of holding control strategies on transit performance: a bus simulation model analysis. Transp Res Rec 2216:51–58CrossRefGoogle Scholar
  16. Cats O, Larijani AN, Ólafsdóttir A, Burghout W, Andreasson I, Koutsopoulos HN (2012) Holding control strategies: a simulation-based evaluation and guidelines for implementation. Transp Res Rec 2274:100–108CrossRefGoogle Scholar
  17. Cats O, Fadaei Oshyani M, West J (2014a) Evaluation of RETT4 pilot study: empirical and simulation analysis of bus and passengers time savings. KTH, SwedenGoogle Scholar
  18. Cats O, Mach Rufi F, Koutsopoulos HN (2014b) Optimizing the number and location of time point stops. Public Transport 6:215–235CrossRefGoogle Scholar
  19. Chien S, Chowdhury S (2002) Intermodal transit system coordination. J Transp Planning Technol 25(4):257–288 Google Scholar
  20. Chung E-H (2009) Transfer coordination model and real-time strategy for inter-modal transit services. Ph.D. Thesis. Department of Civil Engineering. University of Toronto, CanadaGoogle Scholar
  21. Cordeau J-F, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153:29–46CrossRefMathSciNetzbMATHGoogle Scholar
  22. Corman F, Sabene F, Pacciarelli D, Samà M, D’Ariano A (2013) Railway traffic control with minimization of passengers’ discomfort. 3rd MTITS, Dresden, GermanyGoogle Scholar
  23. De Cea J, Fernandez JE (1993) Transit assignment for congestion public transport networks: an equilibrium model. Transp Sci 27:133–147CrossRefzbMATHGoogle Scholar
  24. Di Febbraro A, Recagno V, Sacone S (1996) INTRANET: a new simulation tool for intermodal transport systems. Simul Pract Theory 4:47–64CrossRefGoogle Scholar
  25. Dollevoet T, Huisman D, Schmidt M, Schöbel A (2012) Delay management with rerouting of passengers. Transp Sci 46:74–89CrossRefGoogle Scholar
  26. Dollevoet T, Corman F, D’Ariano A, Huisman D (2014) A bi-level optimization framework for delay management and train scheduling. J Flex Serv Manuf (in press)Google Scholar
  27. Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transp Res B 36:485–506CrossRefGoogle Scholar
  28. Hall R (1985) Vehicle scheduling at a transportation terminal with random delay en route. Transp Sci 19:308–320CrossRefGoogle Scholar
  29. Irving JH, Bernstein H, Olson CL, Buyan J (1978) Fundamentals of personal rapid transit. Lexington Books, Washington DCGoogle Scholar
  30. Jaw J, Odoni AR, Psaraftis HN, Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp Res B 20:243–257CrossRefGoogle Scholar
  31. Kroes E, Kouwenhoven M, Duchateau H, Debrincat L, Goldberg J (2007) Value of punctuality on suburban trains to and from Paris. Transp Res Rec 2006:67–75CrossRefGoogle Scholar
  32. Lam WHK, Zhou J, Sheng Z-H (2002) A capacity restraint transit assignment with elastic line frequency. Transp Res B 36:919–938CrossRefGoogle Scholar
  33. Lee KKT (1993) Optimization of timed transfers in transit terminals. PhD dissertation, University of Maryland, College Park, USAGoogle Scholar
  34. Lee KKT, Schonfeld PM (1991) Optimal slack time for timed transfers at a transit terminal. J Adv Transp 25:281–308CrossRefGoogle Scholar
  35. Lees-Miller J, Hammersley J, Davenport N (2009) Ride sharing in personal rapid transit capacity planning. In: Automated people movers. American Society of Civil Engineers, USAGoogle Scholar
  36. Leurent F (2011) Transport capacity constraints on the mass transit system: a systemic analysis. Eur Transp Res Rev 3:11–21CrossRefGoogle Scholar
  37. Leurent F (2013) Travel demand for a one-way vehicle sharing system: a model of traffic assignment to a multimodal network with supply-demand equilibrium. In: Albrecht T, Jaekel B, Lehnert M (eds) Proceedings of the 3rd international conference on models and technologies for intelligent transportation systems 2013. Verkehrstelematik, vol 3, TUD Press, Dresden, pp 523–534Google Scholar
  38. Leurent F, Chandakas E, Poulhès A (2011) User and service equilibrium in a structural model of traffic assignment to a transit network. Elsevier Proc—Soc Behav Sci 20:495–505Google Scholar
  39. Leurent F, Chandakas E, Poulhès A (2014) A traffic assignment model for passenger transit on a capacitated network: bi-layer framework, line sub-models and large-scale application. Trans Res Part C 47(1):3–27Google Scholar
  40. Li ZC, Huang HJ, Lam WHK, Wong SC (2007) A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints. J Math Model Algorithms 6:239–257CrossRefzbMATHGoogle Scholar
  41. Liu Y, Bunker J, Ferreira L (2010) Transit users’ route-choice modelling in transit assignment: a review. Transp Rev 30:753–769CrossRefGoogle Scholar
  42. Meschini L, Gentile G, Papola N (2007) A frequency based transit model for dynamic traffic assignment to multimodal networks. In: Allsop RE, Bell MGH, Heydecker BG (eds) Transportation and traffic theory 2007. Elsevier, London, pp 407–436Google Scholar
  43. Ngamchai S, Lovell DJ (2003) Optimal time transfer in bus transit route network design using a genetic algorithm. J Transp Eng 129:510–512CrossRefGoogle Scholar
  44. Peric K, Boilé M (2006) Combined model for intermodal networks with variable transit frequencies. Transp Res Board 1964:136–145CrossRefGoogle Scholar
  45. Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49:258–272CrossRefMathSciNetzbMATHGoogle Scholar
  46. Sato K, Tamura K, Tomii N (2013) A MIP-based timetable rescheduling formulation and algorithm minimizing further inconvenience to passengers. J Rail Transp Planning Manage 3:38–53CrossRefGoogle Scholar
  47. Schmöcker JD, Bell MGH, Kurauchi F (2008) A quasi-dynamic capacity constrained frequency-based transit assignment model. Transp Res B 42:925–945CrossRefGoogle Scholar
  48. Sels P, Dewilde T, Cattrysse D, Vansteenwegen P (2013) Expected passenger travel time for train schedule evaluation and optimization. In: Proceedings of the 5th international seminar on railway operations modelling and analysis, Copenhagen, DenmarkGoogle Scholar
  49. Shrivastava P, Dhingra SL (2001) Development of feeder routes for suburban railway stations using heuristic approach. J Transp Eng 127:334–341CrossRefGoogle Scholar
  50. Shrivastava P, Dhingra SL (2002) Development of coordinated schedules using genetic algorithms. J Transp Eng 128:89–96CrossRefGoogle Scholar
  51. Shrivastava P, O’Mahony M (2006) A model for development of optimized feeder routes and coordinated schedules—a genetic algorithms approach. Transp Policy 13:413–425CrossRefGoogle Scholar
  52. Sjödin P (2010) Allokering av tomvagnar I ett spårtaxinätverk via heltalsoptimering. MSc thesis at Department of Mathematics, KTH, Stockholm, SwedenGoogle Scholar
  53. Sumalee A, Tan Z, Lam WHK (2009) Dynamic stochastic transit assignment with explicit seat allocation model. Transp Res B 43:895–912CrossRefGoogle Scholar
  54. Systan Inc. (1983) Timed transfer: an evaluation of its structure, performance and cost. Rep. No. UMTA-MA-06-0049083-6, Urban Mass Transportation Administration,Washington, D.C., USAGoogle Scholar
  55. Szillat MT (2001) A low-level PRT microsimulation. PhD thesis, The University of Bristol, UKGoogle Scholar
  56. TCQSM (2003) Transit capacity and quality of service manual. On-line report prepared for the Transit Cooperative Research Program of the TRB, USAGoogle Scholar
  57. Teklu F (2008) A stochastic process approach for frequency-based transit assignment with strict capacity constraints. Netw Spat Econ 8:225–240CrossRefzbMATHGoogle Scholar
  58. Teklu F, Watling D, Connors R (2007) A markov process model for capacity-constrained frequency-based transit assignment. In: Allsop RE, Bell MGH, Heydecker BG (eds) Transportation and traffic theory 2007. Papers Selected for Presentation at ISTTT17. Elsevier, Amsterdam, NetherlandsGoogle Scholar
  59. Ting CJ (1997) Transfer coordination in transit network. PhD dissertation, University of Maryland, College Park, USAGoogle Scholar
  60. Uchida K, Sumalee A, Watling DP, Connors RD (2007) A study on network design problems for multi-modal networks by probit-based stochastic user equilibrium. Netw Spat Econ 7:213–240Google Scholar
  61. Vuchic VR, Clarke R, Molinero A (1983) Timed transfer system planning, design and operation. Urban Mass Transportation Administration, DOT-I-83-28. Department of Transportation, Washington, D.C., USAGoogle Scholar
  62. Wu ZX, Lam WH (2003) Combined modal split and stochastic assignment model for congested networks with motorized and non-motorized transport modes. Transp Res Board 1831:57–64CrossRefGoogle Scholar
  63. Xiang Z, Chu C, Chen H (2008) The study of a dynamic dial-a-ride problem under time dependent stochastic environments. Eur J Oper Res 185:534–551CrossRefzbMATHGoogle Scholar
  64. Zhou X, Mahmassani HS, Zhang K (2008) Dynamic micro-assignment modeling approach for integrated multimodal urban corridor management. Transp Res C 16:167–186CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ingmar Andreasson
    • 3
  • Fabien Leurent
    • 1
    Email author
  • Francesco Corman
    • 4
  • Luigi dell’Olio
    • 2
  1. 1.Laboratory on City, Mobility and TransportationUniversity Paris-East, Ecole des Ponts ParisTechParisFrance
  2. 2.University of CantabriaSantanderSpain
  3. 3.LogistikCentrum Göteborg ABV FrölundaSweden
  4. 4.Delft University of TechnologyDelftThe Netherlands

Personalised recommendations