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

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

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelPrinciples and Practice of Constraint Programming - 23rd International Conference CP 2017, Proceedings
RedaktørerJ.Christopher Beck
Antal sider17
ForlagSpringer-Verlag London Ltd
Publikationsdato2017
Sider370-386
ISBN (Trykt)9783319661575
DOI
StatusUdgivet - 2017
Udgivet eksterntJa
Begivenhed23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 - Melbourne, Australien
Varighed: 28. aug. 20171. sep. 2017

Konference

Konference23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017
LandAustralien
ByMelbourne
Periode28/08/201701/09/2017
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind10416 LNCS
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'NightSplitter: A scheduling tool to optimize (sub)group activities'. Sammen danner de et unikt fingeraftryk.

Citationsformater