In this tutorial paper we consider a particular design problem which arose in scheduling a social bridge club consisting of twelve couples. At each meeting the club was divided into three groups of four couples, and each couple competed against each other couple in its group. The club met eight times, and it was required that each couple plays against each other couple two or three times. We have used this problem as a vehicle for exploring several techniques of design construction, some of which involve the application of methods more commonly used in continuous optimization problems.
KeywordsSimulated Annealing Automorphism Group Greedy Algorithm Parallel Classis Special Pair
Unable to display preview. Download preview PDF.
- D Ashlock, Finding designs with genetic algorithms, this volume.Google Scholar
- G Chartrand and O R Oellermann, Applied and Algorithmic Graph Theory. McGraw-Hill, 1993.Google Scholar
- J Holland, Adaption in Natural and Artificial Systems. University of Michigan Press, 1975.Google Scholar
- D L Kreher, G F Royle and W D Wallis, A family of resolvable regular graph designs, Discrete Math. (to appear).Google Scholar
- P J M van Laarhoven and E H L Aarts, Simulated Annealing: Theory and Applications. Reidel, 1987.Google Scholar
- R J Simpson, Scheduling a bridge club using a genetic algorithm (submitted).Google Scholar