Abstract
In this chapter we describe a proactive carpooling service that combines induction and optimization mechanisms to maximize the impact of carpooling within a community. The approach autonomously infers the mobility demand of the users through the analysis of their mobility traces (i.e. Data Mining of GPS trajectories) and builds the network of all possible ride sharing opportunities among the users. Then, the maximal set of carpooling matches that satisfy some standard requirements (maximal capacity of vehicles, etc.) is computed through Constraint Programming models, and the resulting matches are proactively proposed to the users. Finally, in order to maximize the expected impact of the service, the probability that each carpooling match is accepted by the users involved is inferred through Machine Learning mechanisms and put in the CP model. The whole process is reiterated at regular intervals, thus forming an instance of the general ICON loop.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: ACM Press, pp. 49–60. ACM Press (1999)
Armendáriz, M., Burguillo, J., Peleteiro, A., Arnould, G., Khadraoui, D.: Carpooling: a multi-agent simulation in Netlogo. In: Proceedings of ECMS (2010)
Bellemans, T., Bothe, S., Cho, S., Giannotti, F., Janssens, D., Knapen, L., Körner, C., May, M., Nanni, M., Pedreschi, D., et al.: An agent-based model to evaluate carpooling at large manufacturing plants. Procedia Comput. Sci. 10, 1221–1227 (2012)
Cho, S., Yasar, A.-U.-H., Knapen, L., Bellemans, T., Janssens, D., Wets, G.: A conceptual design of an agent-based interaction model for the carpooling application. Procedia Comput. Sci. 10, 801–807 (2012)
Cici, B., Markopoulou, A., Frias-Martinez, E., Laoutaris, N.: Assessing the potential of ride-sharing using mobile and social data: a tale of four cities. In: Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing, pp. 201–211. ACM (2014)
Correia, G., Viegas, J.M.: Carpooling and carpool clubs: clarifying concepts and assessing value enhancement possibilities through a stated preference web survey in Lisbon, Portugal. Transp. Res. Part A: Policy Pract. 45(2), 81–90 (2011)
Knapen, L., Keren, D., Yasar, A.-U.-H., Cho, S., Bellemans, T., Janssens, D., Wets, G.: Estimating scalability issues while finding an optimal assignment for carpooling. Procedia Comput. Sci. 19, 372–379 (2013)
Lerenc, V.: Increasing throughput for carpool assignment matching. US Patent App. 13/329,899, 19 December 2011
Massaro, D.W., Chaney, B., Bigler, S., Lancaster, J., Iyer, S., Gawade, M., Eccleston, M., Gurrola, E., Lopez, A.: Carpoolnow-just-in-time carpooling without elaborate preplanning. In: WEBIST, pp. 219–224 (2009)
Teal, R.F.: Carpooling: who, how and why. Transp. Res. Part A: Gen. 21(3), 203–214 (1987)
Trasarti, R., Pinelli, F., Nanni, M., Giannotti, F.: Mining mobility user profiles for car pooling. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1190–1198. ACM (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Nanni, M., Kotthoff, L., Guidotti, R., O’Sullivan, B., Pedreschi, D. (2016). ICON Loop Carpooling Show Case. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O'Sullivan, B., Pedreschi, D. (eds) Data Mining and Constraint Programming. Lecture Notes in Computer Science(), vol 10101. Springer, Cham. https://doi.org/10.1007/978-3-319-50137-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-50137-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50136-9
Online ISBN: 978-3-319-50137-6
eBook Packages: Computer ScienceComputer Science (R0)