A fast, network-based, hybrid heuristic for the assignment of students to schools

In an era of declining and fluctuating enrolments, the determination of appropriate school sizes and student assignments poses difficult problems for administrators. For two decades, researchers have worked with variants of a linear programming district model which minimizes total weighted distance as all students are assigned to schools constrained by both capacity and racial balance limitations. This model could aid in the generation of districting alternatives, but is difficult to solve in realistic applications with generalized solution procedures because of overall problem size. This has prompted the development of fast, network-based models, solvable with special algorithms and codes. The authors show, however, that these approaches all contain major shortcomings. They present a fast, hybrid heuristic based upon two network representations. Computational results demonstrate this to be a very fast solution approach for the general case of this districting problem.