Abstract

Abstract. Single-school and multi-school district divisions are the two main ways to balance educational resources for enrollment in primary and secondary schools. A hybrid heuristic algorithm (M-ILS-SA) for school district division is proposed based on the combination of a Multi-Start Iterative Local Search (M-ILS) algorithm and a Simulated Annealing (SA) algorithm. According to the principle of “school grouping first and student assigning second”, a K-Medoids model is first used to implement school grouping. Then, the initial solution for each run of ILS that starts is generated by the region growth algorithm. After completing the neighborhood search, the SA algorithm is finally used to choose the optimal solution from the historically generated school districts identified by ILS. The experimental results show that the proposed M-ILS-SA algorithm can effectively reduce the total elapsed time and the number of over-enrolled students in each school district, and ensure spatial continuity in both single-school and multi-school district divisions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.