Abstract
The Dial-a-Ride Problem (DARP) consists in serving a set of users who specify their departure or arrival locations using a single vehicle. The aim of DARP is to design vehicle routes satisfying requests of users and minimizing the total traveled distance. In this work, we consider a real case of dynamic DARP service operated by Padam (www.padam.io) in Paris and Bristol. Padam offers a high quality transportation service in which users ask for a service either in real time or in advance, and get an immediate answer about whether their requests are accepted or not. The transport activity is outsourced in Padam’s service, and contracts are negotiated with third parties firms. Then each day, a fixed set of drivers is available during a working period of time to provide a transportation service of Padam. The main goal then becomes to maximize the number of accepted requests during the service. In this work, we develop a two-phase procedure to achieve it. In the first phase an insertion heuristic is used to quickly find out whether a request of a customer can be inserted, then, in the second phase, we run an ALNS algorithm between the occurrence of requests to improve the quality of the solution. The procedure was extensively tested on real data provided by Padam with up to 2000 requests and very tight side constraints and time-windows.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attanasio, A., Cordeau, J.-F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30(3), 8–15 (2004)
Beaudry, A., Laporte, G., Melo, T., Nickel, S.: Dynamic transportation of patients in hospitals. OR Spectrum 32(1), 77–107 (2010)
Ben-Ameur, W.: Computing the initial temperature of simulated annealing. Computational Optimization and Applications 29, 369–385 (2004)
Birattari, M.: Tuning Metaheuristics : A Machine Learning Perspective. Studies in Computational Intelligence, vol. 197, 1st edn. Springer-Verlag, Heidelberg (2009). doi:10.1007/978-3-642-00483-4
Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research part B : Methodological 37(6), 579–594 (2003)
Cordeau, J.-F., Laporte, G.: The dial-a-ride problems, models and algorithms. Annals of Operations Research 153, 29–46 (2007)
Coslovich, L., Pesenti, R., Ukovich, W.: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research 175(3), 1605–1615 (2006)
Diana, M., Dessouky, M.M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B : Methodological 38(6), 539–557 (2004)
Li, B., Krushinsky, D., Van Woensel, T., Reijers, H.A.: An adaptive large neighborhood search heuristic for the share-a-ride problem. Computers and Operations Research 66, 170–180 (2016)
Li, Y., Chen, H., Prins, C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. European Journal of Operational Research 252(1), 27–38 (2016)
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives 3, 43–58 (2016)
Madsen, O.B.G., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60(1), 193–208 (1995)
Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17(3), 351–357 (1983)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455–472 (2006)
Santos, D.O., Xavier, E.C.: Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications 42(19), 6728–6737 (2015)
Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers and Operations Research 38(12), 1719–1730 (2011)
Wilson, N., Sussman, J., Wang, H., Higonnet, B.: Scheduling algorithms for dial-a-ride systems. Technical Report USL-TR-71-13 (1971)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Vallée, S., Oulamara, A., Cherif-Khettaf, W.R. (2017). Maximizing the Number of Served Requests in an Online Shared Transport System by Solving a Dynamic DARP. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-68496-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68495-6
Online ISBN: 978-3-319-68496-3
eBook Packages: Computer ScienceComputer Science (R0)