Abstract
Many discrete optimization problems can be formulated as either integer linear programming problems or constraint satisfaction problems. Although ILP methods appear to be more powerful, sometimes constraint programming can solve these problems more quickly. This paper describes a problem in which the difference in performance between the two approaches was particularly marked, since a solution could not be found using ILP.
The problem arose in the context of organising a “progressive party” at a yachting rally. Some yachts were to be designated hosts; the crews of the remaining yachts would then visit the hosts for six successive half-hour periods. A guest crew could not revisit the same host, and two guest crews could not meet more than once. Additional constraints were imposed by the capacities of the host yachts and the crew sizes of the guests.
Integer linear programming formulations which included all the constraints resulted in very large models, and despite trying several different strategies, all attempts to find a solution failed. Constraint programming was tried instead and solved the problem very quickly, with a little manual assistance. Reasons for the success of constraint programming in this problem are identified and discussed.
Preview
Unable to display preview. Download preview PDF.
References
H. Beringer and B. De Backer. Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers. In C. Beierle and L. Plumer, editors, Logic Programming: Formal Methods and Practical Applications, chapter 8, pages 245–272. Elsevier Science B.V., 1995.
M. Dincbas, H. Simonis, and P. van Hentenryck. Solving a Cutting-Stock problem in constraint logic programming. In R. Kowalski and K. Brown, editors, Logic Programming, pages 42–58. 1988.
R. Haralick and G. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
J.-F. Puget. On the Satisfiability of Symmetrical Constrained Satisfaction Problems. In Proceedings of ISMIS'93, 1993.
J.-F. Puget. A C++ Implementation of CLP. In Proceedings of SPICIS94 (Singapore International Conference on Intelligent Systems), 1994.
J.-F. Puget and B. De Backer. Comparing Constraint Programming and MILP. In APMOD'95, 1995.
P. van Hentenryck and J.-P. Carillon. Generality versus Specificity: an Experience with AI and OR techniques. In Proceedings of AAAI-88, volume 2, pages 660–664, 1988.
H. P. Williams. The elimination of integer variables. JORS, 43:387–393, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P. (1995). The progressive party problem: Integer linear programming and constraint programming compared. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-60299-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60299-6
Online ISBN: 978-3-540-44788-7
eBook Packages: Springer Book Archive