Abstract
We propose a new aspect of mobility that combines in a same journey and in real time a carpooling service and a traditional multi-modal transportation. This mix allows to improve and complete both services. The main idea of our approach is based on the traditional multi-modal path, in which we try to sequentially substitute some sub-paths of traditional multi-modal transportation to carpooling, in order to decrease the rider’s arrival time at his destination. For this purpose, we first define a closeness estimation between the user’s itinerary and available drivers. This allows to select a subset of potential drivers. We then compute sets of driving quickest paths, and design a substitution process. Finally, among all admissible solutions, we select a best one based on the earliest arrival time. We provide numerical results using geographical maps, real data and public transportation timetabling. Our numerical results show the effectiveness of our system, which improves rider’s arrival time compared to the traditional multi-modal path. The running time of our approach remains reasonable to use 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
Similar content being viewed by others
References
Varone, S., Aissat, K.: Multi-modal transportation with public transport and ride-sharing multi-modal transportation using a path-based method. In: In proceedings of ICEIS (2015)
Chan, N.D., Shaheen, S.A.: Ridesharing in north america: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)
Berbeglia, G., Cordeau, J., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010)
Agatz, N.A.H., Erera, A.L., Savelsbergh, M.W.P., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)
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 (2014)
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)
Ambrosino, D., Sciomachen, A.: An algorithmic framework for computing shortest routes in urban multimodal networks with different criteria. Procedia - Soc. Behav. Sci. 108, 139–152 (2014). Operational Research for Development, Sustainability and Local Economies
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. Appl. Math. Model. 38(9–10), 2613–2629 (2014)
Herbawi, W., Weber, M.: The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, 10–15 June 2012, pp, 1–8. IEEE, Brisbane, Australia (2012)
Wagner, D., Dibbelt, J., Delling, D., Werneck, R.F., Pajor, T.: 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)
Müller-Hannemann, M., Schulz, F., Zaroliagis, C.D., Wagner, D.: 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)
Murueta, P.O.P., García, E., de los Angeles Junco Rey, M.: Finding in multimodal networks without timetables. In: VEHICULAR 2014: The Third International Conference on Advances in Vehicular Systems, Technologies and Applications (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), France, Sophia Antipolis, vol. 13328, p. 12, September 2013
Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM J. Comput. 30(3), 809–837 (2000)
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). Carpooling as Complement to Multi-modal Transportation. In: Hammoudi, S., Maciaszek, L., Teniente, E., Camp, O., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2015. Lecture Notes in Business Information Processing, vol 241. Springer, Cham. https://doi.org/10.1007/978-3-319-29133-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-29133-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29132-1
Online ISBN: 978-3-319-29133-8
eBook Packages: Computer ScienceComputer Science (R0)