Abstract
The social golfer problem (SGP) has attracted significant attention in recent years because of its highly symmetrical, constrained, and combinatorial nature. Nowadays, it constitutes one of the standard benchmarks in the area of constraint programming. This paper presents the first evolutionary approach to the SGP. We propose a memetic algorithm (MA) that combines ideas from evolutionary programming and tabu search. In order to lessen the influence of the high number of symmetries present in the problem, the MA does not make use of recombination operators. The search is thus propelled by selection, mutation, and local search. In connection with the latter, we analyze the effect of baldwinian and lamarckian learning in the performance of the MA. An experimental study shows that the MA is capable of improving results reported in the literature, and supports the superiority of lamarckian strategies in this problem.
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.
Similar content being viewed by others
References
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Smith, B.M.: Reducing symmetry in a combinatorial design problem. In: Third International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 351–359 (2001)
Sellmann, M., Harvey, W.: Heuristic constraint propagation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 738–743. Springer, Heidelberg (2002)
Barnier, N., Brisset, P.: Solving kirkman’s schoolgirl problem in a few seconds. Constraints 10, 7–21 (2005)
Ramani, A., Markov, I.: Automatically exploiting symmetries in constraint programming. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 98–112. Springer, Heidelberg (2005)
Prestwich, S.D., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273–287. Springer, Heidelberg (2005)
Mancini, T., Cadoli, M.: Detecting and breaking symmetries by reasoning on problem specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 165–181. Springer, Heidelberg (2005)
Sellmann, M., Hentenryck, P.V.: Structural symmetry breaking. In: Kaelbling, L.P., Saffiotti, A. (eds.) Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), Edinburgh, Scotland, pp. 298–303. Professional Book Center (2005)
Harvey, W., Winterer, T.: Solving the MOLR and social golfers problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 286–300. Springer, Heidelberg (2005)
Gent, I., Lynce, I.: A SAT encoding for the social golfer problem. In: IJCAI 2005 workshop on Modelling and Solving Problems with Constraints, Edinburgh, Scotland (2005)
Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)
Dotú, I., Hentenryck, P.V.: Scheduling social golfers locally. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 155–167. Springer, Heidelberg (2005)
Gent, I., Walsh, T.: CSPLIB: A benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480–481. Springer, Heidelberg (1999)
Fogel, L., Owens, A., Walsh, M.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)
Hinton, G., Nolan, S.: How learning can guide evolution. Complex Systems 1, 495 (1987)
Whitley, D., Gordon, S., Mathias, K.: Lamarckian evolution, the baldwin effect and function optimization. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, Springer, Heidelberg (1994)
Sellmann, M.: The social golfer problem, Web site available at: http://www.cs.brown.edu/people/sello/golf.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotta, C., Dotú, I., Fernández, A.J., Van Hentenryck, P. (2006). Scheduling Social Golfers with Memetic Evolutionary Programming. In: Almeida, F., et al. Hybrid Metaheuristics. HM 2006. Lecture Notes in Computer Science, vol 4030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890584_12
Download citation
DOI: https://doi.org/10.1007/11890584_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46384-9
Online ISBN: 978-3-540-46385-6
eBook Packages: Computer ScienceComputer Science (R0)