Lamarckian Evolution, The Baldwin Effect and Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Heuristic Constraint Propagation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Scheduling social golfers locally
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Automatically exploiting symmetries in constraint programming
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Hi-index | 0.00 |
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.