DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación
Artículo científico (JournalArticle)
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
JAIR distributes articlees for free on the public internet. Individual users may read, download, copy, distribute, print, search, or link to the full texts of indvidual articles, crawl them for indexing, pass them as data to software, or use them for any other lawful purpose as specified in our licensing terms. However, the right to publish complete volumes of the journal in print is reserved exclusively for AAAI, and therefore others may not sell or publish complete volumes of JAIR in print., The Business-to-Business Meeting Scheduling problem consists of scheduling a set of meetings between given pairs of participants to an event, while taking into account participants’ availability and accommodation capacity. A crucial aspect of this problem is that breaks in participants’ schedules should be avoided as much as possible. It constitutes a challenging combinatorial problem that needs to be solved for many real world brokerage events.
In this paper we present a comparative study of Constraint Programming (CP), MixedInteger Programming (MIP) and Maximum Satisfiability (MaxSAT) approaches to this problem. The CP approach relies on using global constraints and has been implemented in MiniZinc to be able to compare CP, Lazy Clause Generation and MIP as solving technologies in this setting. We also present a pure MIP encoding. Finally, an alternative viewpoint is considered under MaxSAT, showing best performance when considering some implied constraints. Experiments conducted on real world instances, as well as on crafted ones, show that the MaxSAT approach is the one with the best performance for this problem, exhibiting better solving times, sometimes even orders of magnitude smaller than CP and MIP., Work partially supported by grants PGC2018-101216-B-I00 and RTI2018-095609-B-I00(MICINN/FEDER, UE), fellowships FJCI-2017-32420, IJC2019-040489-I (MICINN/Juande la Cierva),Ayudas para Contratos Predoctorales 2016(grant number BES-2016-076867,funded by MINECO and co-funded by FSE), AMU Institut Archim ́ede and NSERC Dis-covery Grant 218028/2017., Peer reviewed
Proyecto:
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 PGC2018-101216-B-I00
,
AEI / Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 RTI2018-095609-B-I00
DOI: http://hdl.handle.net/10261/404262, https://api.elsevier.com/content/abstract/scopus_id/85132020291
HANDLE: http://hdl.handle.net/10261/404262, https://api.elsevier.com/content/abstract/scopus_id/85132020291