Skip to content

Latest commit

 

History

History
12 lines (10 loc) · 393 Bytes

README.md

File metadata and controls

12 lines (10 loc) · 393 Bytes

GA timetable

Using a genetic algorithm; approximate an optimal timetable.

Problem

  • M participants.
  • D days.
  • Each participants has a preferential list of workshops.
  • For each day, place all participants into workshops.
  • Participants should be placed into workshops they like.
  • Workshops should have similar age groups.
  • Workshop groups should be similar in size.