Humans are social animals and usually organize activities in groups. However, they are often willing to split temporarily a bigger group in subgroups to enhance their preferences. In this work we present NightSplitter, an on-line tool that is able to plan movie and dinner activities for a group of users, possibly splitting them in subgroups to optimally satisfy their preferences. We first model and prove that this problem is NP-complete. We then use Constraint Programming (CP) or alternatively Simulated Annealing (SA) to solve it. Empirical results show the feasibility of the approach even for big cities where hundreds of users can select among hundreds of movies and thousand of restaurants.
NightSplitter: A scheduling tool to optimize (sub)group activities / Liu, Tong*; Di Cosmo, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo. - STAMPA. - 10416:(2017), pp. 370-386. (Intervento presentato al convegno 23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 tenutosi a aus nel 2017) [10.1007/978-3-319-66158-2_24].
NightSplitter: A scheduling tool to optimize (sub)group activities
Liu, Tong;Gabbrielli, Maurizio;
2017
Abstract
Humans are social animals and usually organize activities in groups. However, they are often willing to split temporarily a bigger group in subgroups to enhance their preferences. In this work we present NightSplitter, an on-line tool that is able to plan movie and dinner activities for a group of users, possibly splitting them in subgroups to optimally satisfy their preferences. We first model and prove that this problem is NP-complete. We then use Constraint Programming (CP) or alternatively Simulated Annealing (SA) to solve it. Empirical results show the feasibility of the approach even for big cities where hundreds of users can select among hundreds of movies and thousand of restaurants.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
