A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools
作者:
SchoepfleO. Benjamin,
ChurchRichard L.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1989)
卷期:
Volume 40,
issue 11
页码: 1029-1040
ISSN:0160-5682
年代: 1989
DOI:10.1057/jors.1989.176
出版商: Taylor&Francis
关键词: Bounded Transportation Problem;Districting;Generalized Networks;Heuristics
数据来源: Taylor
摘要:
AbstractIn 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 districting 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. We show, however, that these approaches all contain major shortcomings. We 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.
点击下载:
PDF (6327KB)
返 回