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

Tong Liu*, Roberto Di Cosmo, Maurizio Gabbrielli, Jacopo Mauro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 23rd International Conference CP 2017, Proceedings
EditorsJ.Christopher Beck
Number of pages17
PublisherSpringer
Publication date2017
Pages370-386
ISBN (Print)9783319661575
DOIs
Publication statusPublished - 2017
Externally publishedYes
Event23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 - Melbourne, Australia
Duration: 28. Aug 20171. Sept 2017

Conference

Conference23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017
Country/TerritoryAustralia
CityMelbourne
Period28/08/201701/09/2017
SeriesLecture Notes in Computer Science
Volume10416 LNCS
ISSN0302-9743

Fingerprint

Dive into the research topics of 'NightSplitter: A scheduling tool to optimize (sub)group activities'. Together they form a unique fingerprint.

Cite this