Abstract
We consider a mix transportation problem, which allows to combine a multi-modal public and a ride-sharing transports, in a dynamic environment. The main idea of our approach consists in labelling interesting nodes of a geographical map with information about either riders or drivers, in so-called buckets. Based on the information contained in these buckets, we compute admissible ride-sharing possibilities. To restrict the needed amount of memory, among the different stops along a public transportation path, we only consider the transshipment nodes, where travellers have to make a change between two modes. Each of those stops are potential pick-up or drop-off stops for ride-sharing. We consider a drivers’ maximal waiting time, as well as the maximal driving detour time depending on the actual drive. Each new drive activates a search for new ride-sharing of existing riders. Each new ride activates another process which searches for potential drivers. Among all admissible ride-sharing possibilities, only those which best improve the earliest arrival time are selected. We provide numerical results using real road network of the Lorraine region (FR) and real data provided by a local company. Our numerical experiment shows a running time of a few seconds, suitable for a new real-time transportation application.
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.
Similar content being viewed by others
References
Ambrosino, D., Sciomachen, A.: An algorithmic framework for computing shortest routes in urban multimodal networks with different criteria. Procedia - Social and Behavioral Sciences 108, 139–152 (2014), operational Research for Development, Sustainability and Local Economies
Bast, H., Delling, D., Goldberg, A., MĂĽller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. MSR-TR-2014-4Â 8, Microsoft Research (January 2014)
Bit-Monnot, A., Artigues, C., Huguet, M.J., Killijian, M.O.: Carpooling: the 2 synchronization points shortest paths problem. In: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Sophia Antipolis, France, vol. 13328, p. 12 (September 2013)
Delling, D., Dibbelt, J., Pajor, T., Wagner, D., Werneck, R.F.: Computing multimodal journeys in practice. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 260–271. Springer, Heidelberg (2013)
Liu, L., Yang, J., Mu, H., Li, X., Wu, F.: Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network. Applied Mathematical Modelling 38(9-10), 2613–2629 (2014)
Müller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable information: Models and algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 67–90. Springer, Heidelberg (2007)
Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. J. Exp. Algorithmics 12, 2.4:1–2.4:39 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Aissat, K., Varone, S. (2015). Real-Time Ride-Sharing Substitution Service in Multi-modal Public Transport Using Buckets. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_37
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)