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.


Simulated Annealing Automorphism Group Greedy Algorithm Parallel Classis Special Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D Ashlock, Finding designs with genetic algorithms, this volume.Google Scholar
  2. [2]
    R B Brown, Nonexistence of a regular graph design with v = 17 and k = 8, Discrete Math 68, 1988, 315–318.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    G Chartrand and O R Oellermann, Applied and Algorithmic Graph Theory. McGraw-Hill, 1993.Google Scholar
  4. [4]
    B S Elenbogen and B R Maxim, Scheduling a bridge club (a case study in discrete optimization), Math Mag 65 (1992), 18–26.MathSciNetCrossRefMATHGoogle Scholar
  5. [5]
    J Holland, Adaption in Natural and Artificial Systems. University of Michigan Press, 1975.Google Scholar
  6. [6]
    J A John and T J Mitchell, Optimal incomplete block designs, J. Royal Statist. Soc. 39B (1977), 39–43.MathSciNetMATHGoogle Scholar
  7. [7]
    E S Kramer and D M Mesner, t-designs on hypergraphs, Discrete Math. 15 (1976), 293–296.MathSciNetCrossRefGoogle Scholar
  8. [8]
    D L Kreher, Y M Chee, D de Caen, C J Colbourn and E S Kramer, Some new simple t-designs, J. Combin. Math. Combin. Comput. 7 (1990), 53–90.MathSciNetMATHGoogle Scholar
  9. [9]
    D L Kreher and S P Radziszowski, Finding t-designs by using basis reduction, Congressus Num. 55 (1986), 235–244.MathSciNetGoogle Scholar
  10. [10]
    D L Kreher, G F Royle and W D Wallis, A family of resolvable regular graph designs, Discrete Math. (to appear).Google Scholar
  11. [11]
    P J M van Laarhoven and E H L Aarts, Simulated Annealing: Theory and Applications. Reidel, 1987.Google Scholar
  12. [12]
    G F Royle and W D Wallis, Constructing bridge club designs, Bull. Inst. Combin. Appl 11 (1994), 122–125.MathSciNetMATHGoogle Scholar
  13. [13]
    R J Simpson, Scheduling a bridge club using a genetic algorithm (submitted).Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1996

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations