Answers are grounded in this paper and cite their sources.
Determining an effective seating plan is a key challenge in classroom management, as the spatial arrangement of students directly influences interpersonal dynamics and the overall learning environment. This paper introduces the Student Seat Allocation Problem (SSAP), which consists of strategically assigning students to seats in a traditional classroom, to minimize interpersonal conflicts while satisfying operational constraints. We propose a mathematical model and an Iterated Local Search (ILS) heuristic to address the SSAP. Computational experiments on a benchmark of 131 instances show that both methods converge to the optimal solution in 78 small- and medium-scale instances. For large-scale instances, Gurobi frequently exceeded the time limit, yet achieved very low optimality gaps, outperforming the heuristic’s average gap in 45 instances. ILS, in turn, outperformed Gurobi in 8 instances, and, when analyzing individual runs, successfully reached a gap of zero in multiple executions for several large-scale instances — within a fraction of Gurobi’s computational time. These results position ILS as an effective and accessible alternative for educational institutions where commercial solver licenses are unavailable or cost-prohibitive.
No takes yet. Share an insight, caveat, or question.
Charytitsch et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: