Cinema seating planning

Libraries: NetworkX , Pandas

For a course at Utrecht University, groups of students were assigned to construct algorithms that could efficiently fill a cinema under Covid distance regulations.

Two approaches were followed; heuristics and integer linear programming (ILP). For the heuristics approach, multiple algorithms were designed and tried out on different input data. Subsequently, the results were compared against each other. For the ILP approach, the algorithm should come up with the best possible seating assignment. Additionaly, the time expenditure was analysed.

GitHub