Abstract
In this paper we present a formulation of the Integrated Dial-a-Ride (IDARP). This problem is to schedule dial-a-ride requests, where some part of each journey may be carried out by a fixed route service. The IDARP is a generalization of the Dial-a-Ride Problem. An arc-based formulation is proposed, and it is shown how the model can be made easier to solve by arc elimination, variable substitution and the introduction of subtour elimination constraints. Small instances of the IDARP can be solved using an exact solution method, and one such instance is studied. We also describe how input and output data can be created and visualized in a geographic information system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldaihani M, Dessouky M (2003) Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45:75–96
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
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
Bergvinsdottir K, Larsen J, Jorgensen R (2004) Solving the dial-a-ride problem using genetic algorithms. Technical Report 2004-20, Informatics and Mathematical Modelling, Technical University of Denmark, Denmark
Börjesson M (2001) Erfarenheter av samordning av färdtjänst och sjukresor i Dalsland. Vinnova Rapport 2001:27
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
Chan S (2004) Metaheuristics for solving the dial-a-ride problem. PhD Thesis, North Carolina State University, USA
Cordeau J (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54:573–586
Cordeau J, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37:579–594
Diana M, Dessouky M (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp Res Part B 38:539–557
Hickman M, Blume K (2001) An investigation of integrated transit service. Research Report SWUTC/01/472840-00023-1, Texas Transportation Institute, USA
Horn M (2004) Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services. Transp Res Part C 12:33–55
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
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
Liaw C, White C, Bander J (1996) A decision support system for the bimodal dial-a-ride problem. IEEE Trans Syst Man Cybern Part A 26:552–565
Madsen O, Ravn H, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60:193–208
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
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
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
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
Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31:60–71
Uchimura K, Takahashi H, Saitoh T (2002) Demand responsive services in hierarchical public transportation system. IEEE Trans Veh Technol 51:760–766
Wilson N, Sussman J, Wang H, Higonnet B (1971) Scheduling algorithms for dial-a-ride systems. Technical Report USL-TR-71-13, Massachusetts Institute of Technology, USA
Wilson N, Weissberg R, Hauser J (1976) Advanced dial-a-ride algorithms research project: Final report. Technical Report 76-20, Massachusetts Institute of Technology, USA
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Häll, C.H., Andersson, H., Lundgren, J.T. et al. The Integrated Dial-a-Ride Problem. Public Transp 1, 39–54 (2009). https://doi.org/10.1007/s12469-008-0006-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12469-008-0006-1