Skip to main content
SpringerLink
Log in

A modeling system for simulation of dial-a-ride services

  • Original Paper
  • Published:
Public Transport Aims and scope Submit manuscript

Abstract

We present a modeling system for simulation of dial-a-ride services. It can be used as a tool for understanding and study how different designs, and different ways to operate a dial-a-ride service, affect the performance and efficiency of the service. The system simulates the operation of a dynamic dial-a-ride service that operates with multiple fleets of vehicles with different capacities, schedules and depots. It can be used to investigate how the setting of service and cost parameters and the design of the service affect the total cost for the operator and level of service for the customer. We describe the different modules in the system and the possible uses of the system. A short simulation study is performed to exemplify how it can be used. In this study the effects of including costs for customer discomfort are evaluated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Attanasio A, Cordeau J, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30:377–387

    Article  Google Scholar 

  • Bailey W, Clark T (1987) A simulation analysis of demand and fleet size effects on taxicab service rates. In: WSC’87: Proceedings of the 19th conference on winter simulation, pp 838–844

    Chapter  Google Scholar 

  • Baugh J, Kakivaya G, Stone J (1998) Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30:91–123

    Article  Google Scholar 

  • Beaudry A, Laporte G, Melo T, Nickel S (2010) Dynamic transportation of patients in hospitals. OR Spektrum 32:77–107

    Article  Google Scholar 

  • Berbeglia G, Cordeau J, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202:8–15

    Article  Google Scholar 

  • Borndörfer R, Grötschel M, Klostermeier F, Küttner C (1997) Telebus Berlin: vehicle scheduling in a dial-a-ride system. Technical report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin

  • Colorni A, Righini G (2001) Modeling and optimizing dynamic dial-a-ride problems. Int Trans Oper Res 8:155–166

    Article  Google Scholar 

  • Cordeau J (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54:573–586

    Article  Google Scholar 

  • Cordeau J, Laporte G (2003a) The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR 1:89–101

    Article  Google Scholar 

  • Cordeau J, Laporte G (2003b) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res, Part B 37:579–594

    Article  Google Scholar 

  • Cordeau J, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153:29–46

    Article  Google Scholar 

  • Cordeau J, Laporte G, Potvin J, Savelsbergh M (2004) Transportation on demand. Technical report CRT-2004-25, Centre For Research on Transportation

  • Deflorio F, Chiara BD, Murro A (2002) Simulation and performance of DRTS in a realistic environment. In: Proceedings of the 13th mini-Euro conference handling uncertainty in the analysis of traffic and transportation systems and the 9th meeting of the Euro working group on transportation intermodality, sustainability and intelligent transport systems, pp 622–628

    Google Scholar 

  • Diana M, Dessouky M, Xia N (2006) A model for the fleet sizing of demand responsive transportation services with time windows. Transp Res, Part B 40:651–666

    Article  Google Scholar 

  • Fu L (2002a) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transp Res, Part B 36:485–506

    Article  Google Scholar 

  • Fu L (2002b) A simulation model for evaluating advanced dial-a-ride paratransit systems. Transp Res, Part A 36:291–307

    Article  Google Scholar 

  • Fu L, Teply S (1999) On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. Comput-Aided Civ Infrastruct Eng 14:309–319

    Article  Google Scholar 

  • Gerrard M (1974) Comparison of taxi and dial-a-bus services. Transp Sci 8:85–101

    Article  Google Scholar 

  • Häll C, Andersson H, Lundgren J, Värbrand P (2009) The integrated dial-a-ride problem. Public Transp 1:39–54

    Article  Google Scholar 

  • Haugland D, Ho S (2010) Feasibility testing for dial-a-ride problems. In: Chen B (ed) Lecture notes in computer science, vol 6124. Springer, Berlin, pp 170–179

    Google Scholar 

  • Heathington K, Miller J, Knox R, Hoff G, Bruggeman J (1968) Computer simulation of a demand scheduled bus system offering door-to-door service. Highw Res Rec 251:26–40

    Google Scholar 

  • Ho S, Haugland D (2011) Local search heuristics for the probabilistic dial-a-ride problem. OR Spektrum 33:961–988

    Article  Google Scholar 

  • Högberg M (2008) On improving paratransit scheduling by using more accurate distance matrices, local search and demand estimation. Master thesis E332, Optimization and Systems Theory, KTH

  • Hunsaker B, Savelsbergh M (2002) Efficient feasibility testing for dial-a-ride problems. Oper Res Lett 30:169–173

    Article  Google Scholar 

  • Ioachim I, Desrosiers J, Dumas Y, Solomon M, Villeneuve D (1995) A request clustering algorithm for door-to-door handicapped transportation. Transp Sci 29:63–78

    Article  Google Scholar 

  • Jaw J, Odoni A, Psaraftis H, Wilson N (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp Res, Part B 20:243–257

    Article  Google Scholar 

  • Madsen O, Ravn H, Moberg Rygaard J (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60:193–208

    Article  Google Scholar 

  • Noda I, Ohta M, Shinoda K, Kumada Y, Nakashima H (2003) Evaluation of usability of dial-a-ride systems by social simulation. In: Proc of fourth international workshop on multi-agent-based simulation, pp 139–152

    Google Scholar 

  • Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations. J Betriebswirtsch 58:81–117

    Article  Google Scholar 

  • Psaraftis H (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14:130–154

    Article  Google Scholar 

  • Psaraftis H (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17:351–357

    Article  Google Scholar 

  • Quadrifoglio L, Dessouky M, Ordóñez F (2008) A simulation study of demand responsive transit system design. Transp Res, Part A 42:718–737

    Google Scholar 

  • Ropke S, Cordeau J, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49:258–272

    Article  Google Scholar 

  • Tang J, Kong Y, Lau H, Ip A (2010) A note on “Efficient feasibility testing for dial-a-ride problems”. Oper Res Lett 38:405–407

    Article  Google Scholar 

  • Teodorovic D, Radivojevic G (2000) A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets Syst 116:23–33

    Article  Google Scholar 

  • Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31:60–71

    Article  Google Scholar 

  • Uchimura K, Takahashi H, Saitoh T (2002) Demand responsive services in hierarchical public transportation system. IEEE Trans Veh Technol 51:760–766

    Article  Google Scholar 

  • Wilson N, Sussman J, Goodman L, Higonnet B (1969) Simulation of a computer aided routing system (CARS). In: Proceedings of the third conference on applications of simulation, pp 171–183

    Google Scholar 

Download references

Acknowledgements

This research is part of a project financed by the Swedish Governmental Agency for Innovation Systems (VINNOVA) and the Swedish Transport Administration. The work has been done in collaboration with Planit Sweden AB and Malmator.

Author information

Authors and Affiliations

  1. Dept. of Science and Technology (ITN), Linköping University, 60174, Norrköping, Sweden

    Carl H. Häll & Jan T. Lundgren

  2. Astando AB, 11221, Stockholm, Sweden

    Magdalena Högberg

Authors
  1. Carl H. Häll
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magdalena Högberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan T. Lundgren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carl H. Häll.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Häll, C.H., Högberg, M. & Lundgren, J.T. A modeling system for simulation of dial-a-ride services. Public Transp 4, 17–37 (2012). https://doi.org/10.1007/s12469-012-0052-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12469-012-0052-6

Keywords

Search

Navigation