A Comparative Study of MIP and CP Formulations for the B2B Scheduling Optimization Problem
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.
KeywordsTime Slot Feasibility Problem Large Neighbourhood Search Fairness Constraint Backtrack Search
Unable to display preview. Download preview PDF.
- 5.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)Google Scholar
- 8.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)Google Scholar