An effective greedy heuristic for the Social Golfer Problem
- 158 Downloads
The Social Golfer Problem (SGP) is a combinatorial optimization problem that exhibits a lot of symmetry and has recently attracted significant attention. In this paper, we present a new greedy heuristic for the SGP, based on the intuitive concept of freedom among players. We use this heuristic in a complete backtracking search, and match the best current results of constraint solvers for several SGP instances with a much simpler method. We then use the main idea of the heuristic to construct initial configurations for a metaheuristic approach, and show that this significantly improves results obtained by local search alone. In particular, our method is the first metaheuristic technique that can solve the original problem instance optimally. We show that our approach is also highly competitive with other metaheuristic and constraint-based methods on many other benchmark instances from the literature.
KeywordsSports scheduling Combinatorial optimization Design theory Finite geometry
Unable to display preview. Download preview PDF.
- Aguado, A. (2004). A 10 days solution to the social golfer problem. Manuscript. Google Scholar
- Dotú, I., & Hentenryck, P. V. (2005). Scheduling social golfers locally. In LNCS: Vol. 3524. CPAIOR (pp. 155–167). Google Scholar
- Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In LNCS: Vol. 2239. CP’01, the 7th int. conf. on principles and practice of constraint programming (pp. 93–107). Google Scholar
- Gent, I., & Lynce, I. (2005). A SAT encoding for the social golfer problem. In IJCAI’05 workshop on modelling and solving problems with constraints. Google Scholar
- Gent, I. P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. In LNCS: Vol. 1713. CP’99. Google Scholar
- Harvey, W. (2002). Warwick’s results page for the social golfer problem. http://www.icparc.ic.ac.uk/~wh/golf/.
- Harvey, W., & Winterer, T. (2005). Solving the MOLR and social golfers problems. In LNCS: Vol. 3709. CP’05 (pp. 286–300). Google Scholar
- McKay, B. (1990). Nauty user’s guide (version 1.5) (Technical report). Dept. Comp. Sci., Australian National University. Google Scholar
- Petrie, K. E., Smith, B., & Yorke-Smith, N. (2004). Dynamic symmetry breaking in constraint programming and linear programming hybrids. In European starting AI researcher symp. Google Scholar