NightSplitter: a scheduling tool to optimize (sub)group activities

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.
Type de document :
Communication dans un congrès
CP 2017 - 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. Springer, 10416, pp.370-386, Lecture Notes in Computer Science. 〈10.1007/978-3-319-66158-2_24〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01648192
Contributeur : Tong Liu <>
Soumis le : vendredi 24 novembre 2017 - 21:12:43
Dernière modification le : vendredi 12 octobre 2018 - 15:22:12

Fichier

cp2017.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Tong Liu, Roberto Di Cosmo, Maurizio Gabbrielli, Jacopo Mauro. NightSplitter: a scheduling tool to optimize (sub)group activities. CP 2017 - 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. Springer, 10416, pp.370-386, Lecture Notes in Computer Science. 〈10.1007/978-3-319-66158-2_24〉. 〈hal-01648192〉

Partager

Métriques

Consultations de la notice

80

Téléchargements de fichiers

28