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

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Liu, T., Di Cosmo, R., Gabbrielli, M., & Mauro, J. (2017). NightSplitter: A scheduling tool to optimize (sub)group activities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10416 LNCS, pp. 370–386). Springer Verlag. https://doi.org/10.1007/978-3-319-66158-2_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free