Published August 28, 2017
| Version v1
Conference paper
NightSplitter: a scheduling tool to optimize (sub)group activities
Contributors
Others:
- Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
- Inria Siège ; Institut National de Recherche en Informatique et en Automatique (Inria)
- Department of Computer Science and Engineering [Bologna] (DISI) ; Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
- Foundations of Component-based Ubiquitous Systems (FOCUS) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI) ; Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)-Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
Description
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.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://hal.inria.fr/hal-01648192
- URN
- urn:oai:HAL:hal-01648192v1
Origin repository
- Origin repository
- UNICA