PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Nanni M., Kotthoff L., Guidotti R., O'Sullivan B., Pedreschi D. ICON Loop carpooling show case. Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi. (Lecture Notes in Computer Science, vol. 10101). Cham, Switzerland: Springer International Publishing, 2016.
 
 
Abstract
(English)
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.
URL: http://link.springer.com/chapter/10.1007%2F978-3-319-50137-6_13
DOI: 10.1007/978-3-319-50137-6_13
Subject Carpooling,
Mobility Profiles
Constraint Programming
H.2.8 DATABASE MANAGEMENT. Database Applications. Data Mining
68W01


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional