Abstract
The Business-to-Business Meeting Scheduling Problem was recently introduced to this community. It consists of scheduling meetings between given pairs of participants to an event while taking into account participant availability and accommodation capacity. The challenging aspect of this problem is that breaks in a participant’s schedule should be avoided as much as possible. In an earlier paper, starting from two generic CP and Pseudo-Boolean formulations, several solving approaches such as CP, ILP, SMT, and lazy clause generation were compared on real-life instances. In this paper we use this challenging problem to study different formulations adapted either for MIP or CP solving, showing that the cost_regular global constraint can be quite useful, both in MIP and CP, in capturing the problem structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E., Saltzman, M.J.: An Algorithm for the Three-Index Assignment Problem. Operations Research 39(1), 150–161 (1991)
Bofill, M., Espasa, J., Garcia, M., Palahí, M., Suy, J., Villaret, M.: Scheduling B2B Meetings. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 781–796. Springer, Heidelberg (2014)
Côté, M.-C., Gendron, B., Rousseau, L.-M.: Modeling the Regular Constraint with Integer Programming. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 29–43. Springer, Heidelberg (2007)
Demassey, S., Pesant, G., Rousseau, L.-M.: A Cost-Regular Based Hybrid Column Generation Approach. Constraints 11(4), 315–333 (2006)
Harvey, W.D., Ginsberg, M.L.: Limited Discrepancy Search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 1995, Montréal Québec, Canada, August 20–25, 1995, vol. 2, pp. 607–615. Morgan Kaufmann (1995)
Pesant, G., Quimper, C.-G., Zanarini, A.: Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. J. Artif. Intell. Res. (JAIR) 43, 173–210 (2012)
Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proceedings of the Thirteenth National/Eighth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, AAAI-98/IAAI-98, vol. 1, pp. 209–215 (1996)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pesant, G., Rix, G., Rousseau, LM. (2015). A Comparative Study of MIP and CP Formulations for the B2B Scheduling Optimization Problem. In: Michel, L. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2015. Lecture Notes in Computer Science(), vol 9075. Springer, Cham. https://doi.org/10.1007/978-3-319-18008-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-18008-3_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18007-6
Online ISBN: 978-3-319-18008-3
eBook Packages: Computer ScienceComputer Science (R0)