Abstract
In this paper, we describe a system that our team developed to solve the problem of heterogeneously partitioning students into classes for the Singapore International School based in Hong Kong. This problem has multiple objectives such as to achieve similar class sizes, similar gender ratios among all classes, each student having at least one old classmate of the same gender, conflict avoidance among students, and similarity of score distribution curves. We proved that this problem is extremely hard and provided an example to show that the number of feasible solutions is astronomical for only medium size cases. We devised and implemented a simulated annealing (SA) algorithm to solve this problem. Our experimental results based on real application data indicate that our SA algorithm is able to improve the quality of the school’s partitioning solutions and clearly meets all objectives set out by the client.
Chapter PDF
Similar content being viewed by others
References
Wheelock, A.: Crossing the Tracks: How “Untracking” Can Save America’s Schools. The New Press, New York (1992)
Garey, M.R., Johnson, D.S.: Computers and Intractibility: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, W., Qin, H., Lim, A., Xu, Z. (2010). Balanced Student Partitioning to Promote Effective Learning: Applications in an International School. In: Kang, BH., Richards, D. (eds) Knowledge Management and Acquisition for Smart Systems and Services. PKAW 2010. Lecture Notes in Computer Science(), vol 6232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15037-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-15037-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15036-4
Online ISBN: 978-3-642-15037-1
eBook Packages: Computer ScienceComputer Science (R0)