SCHOOL ASSIGNMENT PROCESS
Students are assigned to elementary schools based on the walking distance from their homes. The District uses a well-studied algorithm to optimize school assignment by assigning students to the closest schools that have available room. Information on the algorithm can be found at the bottom of this page.
Each enrollment period is a self-contained cycle. The algorithm will take into account the walking distance for all students who register within a given enrollment period.
DISTANCE CALCULATION
If you would like to calculate the distance to each of the six elementary schools in the district in the same manner as the district does at assignment time, please enter a complete address within the BRSSD school district. As an example, the address for the district office should be entered as 2960 Hallmark Drive and Belmont should be selected as the city.
The Distance Calculator is currently unavailable and will return shortly.
PRIORITY REASSIGNMENT PROCESS
The BRSSD has fulfilled its school assignment goal if your child has been assigned to his/her first or second closest school. The following outlines our Reassignment Process:
Students assigned to their third, fourth, fifth, or sixth closest school will be automatically placed on the Priority Reassignment list.
Siblings assigned to different schools will be automatically placed on the Priority Reassignment list.
Students on the Priority Reassignment list will be given first consideration for seats that become available at their first or second closest school during subsequent enrollment periods.
After school starts and through April 30, students on the Priority Reassignment list will be offered school reassignment if a seat becomes available at their first or second closest school.
Students who remain on the Priority Reassignment list after April 30 will be given first consideration for open seats in the next school year.
A student remains on the Priority Reassignment list until reassignment is offered, the student enters middle school, or the student dis-enrolls from the BRSSD.
HOW DOES THE ALGORITHM WORK TO ASSIGN STUDENTS?
The Belmont-Redwood Shores School District assigns students to schools using an algorithm based on a linear optimization function known as minimum-cost flow formula. Companies use similar linear optimization functions (also called linear programming) to make important business decisions. For example, airlines use linear optimization to determine flight routes and minimize fuel costs. Shipping companies use a similar method to move packages from warehouses to stores to customers efficiently.
In our case, the District uses linear optimization to assign incoming students to schools close to their homes and within the limits of each school’s enrollment capacity. The assignment algorithm allows the District to find the optimal solution to minimize the total distance traveled by all students to their schools. One way to think about the District’s goal is to imagine a pedometer attached to every student for one morning’s walk to school; the optimal assignment would minimize the sum of the distances of all students’ walks to their schools. Instead of pedometers, however, the District uses a Web-based mapping service, such as Bing Maps, to determine the walking distance for all students.
The algorithm consists of two distinct phases. In the first phase, the distance from each student’s home to each of the six elementary schools is calculated. In the second phase, which can be run repeatedly with different parameters, these distances are used, along with minimum and maximum capacity of each school, to perform an assignment that minimizes the total distance traveled.
To calculate distances, Bing Maps transforms the addresses of each student to a latitude and longitude. This location is then used to calculate the walking distance to each school entrance. There are two schools that have multiple entrances; for those schools the distance used for assignment is the minimum distance to any of the school’s entrances.
Once the distances are calculated for each student, the assignment is performed according to the capacity constraints provided by the program operator. Microsoft Solver Foundation is used to minimize the total distance traveled by all students being assigned while respecting the capacity constraints at each school.