Abstract
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one of the standard benchmarks for symmetry breaking in constraint programming. This paper presents a very effective, local search, algorithm for scheduling social golfers. The algorithm find the first known solutions to 11 instances and matches, or improves, state-of-the-art results from constraint programming on all but 3 instances. Moreover, most instances of the social golfers are solved within a couple of seconds. Interestingly, the algorithm does not incorporate any symmetry-breaking scheme and illustrates the nice complementarity between constraint programming and local search on this scheduling application.
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
Ågren, M.: Solving the Social Golfer Using Local Search (2003), http://peg.it.uu.se/~saps02/MagnusAgren/
Barnier, N., Brisset, P.: Solving kirkman’s schoolgirl problem in a few seconds. Constraints (2005); Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 477. Springer, Heidelberg (2002)
Colbourn, C., Dinitz, J.H.: The CRC Handbook of Combinatorial Design. CRC Press, Boca Raton (1996)
Colbourn, C.J., Dinitz, J.H.: Mutually orthogonal latin squares: A brief survey of constructions. Journal of Statistical Planning and Inference 95, 9–48 (2001)
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Prestwich, S.: Randomized backtracing for linear pseudo-boolean constraint problems. In: Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2002), Le Croisic, France, March 2002, pp. 7–19 (2002)
Prestwich, S.D.: Supersymmetric Modeling for Local Search. In: Second International Workshop on Symmetry in Constraint Satisfaction Problems (2002)
Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research 118, 137–150 (2003)
Puget, J.F.: Symmetry breaking revisited. Constraints (2005); Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 446. Springer, Heidelberg (2002)
Sellmann, M.: Reduction Techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn, Germany (2003)
Sellmann, M., Harvey, W.: Heuristic constraint propagation – Using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In: Jussien, N., Laburthe, F. (eds.) Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2002), Le Croisic, France, March 2002, pp. 191–204 (2002)
Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. In: CP-AI-OR 2001, Wye College (Imperial College), Ashford, Kent UK, April 2001, pp. 351–359 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dotú, I., Van Hentenryck, P. (2005). Scheduling Social Golfers Locally. In: Barták, R., Milano, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2005. Lecture Notes in Computer Science, vol 3524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493853_13
Download citation
DOI: https://doi.org/10.1007/11493853_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26152-0
Online ISBN: 978-3-540-32264-1
eBook Packages: Computer ScienceComputer Science (R0)