Home

Dancecard

This is an algorithm to solve the "driving trip" problem:

• n cars
• 2n drivers
• s sessions
• In each session, 2 drivers pair up per car
• We want to optimise for:
  • Everyone driving each car roughly the same number of times
  • Everyone driving with everyone else evenly
  • Minimising repetition - e.g. driving same car or with same person in nearby sessions

Other wiki pages

• How to run the algorithm.
• Supported strategies.
• Details on distributing the computation.
• Future development