-
Notifications
You must be signed in to change notification settings - Fork 363
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Great effort! Here are some edge cases you might need to consider in future. #2
Comments
I have a simple solution idea for CASE-2. Existing Logic
New Logic
What does it solve?
|
I have created a pull requests that might solve CASE 1. Considered using route distance instead of direct Haversine Distance. Considers the best possible route distance using maps api Here is the PR #67 |
this is a useful discussion.
CASE 1: @ArunShresthaa's #67 is more precise but has external dependencies and cost implication, cost to benefit does not make sense at this point. Interested can explore other options to see if there is a better alternative but haversine distance is quick and good enough approximation. Case 2: will be dealt in #31 Closing this ticket |
Hi, this is a great effort to have an open sourced algorithm for doing things like this. I hope you continue to open source any other problems/solutions so that more people might be able to take a look at them.
On a quick look, I didn't find any big issue. I am just going to mention some edge cases that I thought of while going through the code. You may need to account for these situations (in future) if you haven't already done so. Piloting this in Kathmandu, itself shouldn't be problematic but as you expand this in future these cases might occur more frequently. Case 3. and 4. might be applicable in Kathmandu as well.
Distance calculation with latitude, longitude doesn't always equal to distance students need to travel by road.
Example:
For places in remote areas, where there is no accessible bridge available and the center happens to be on the other side of river,
closest by km might not be easily accessible.
Maybe this can be handled by setting up prefs code?
If no centers are within the absolute distance threshold, it always chooses the same center(the closest one)
Example: If school A doesn't have any center within threshold (7km).
But has 5 centers near threshold but slightly different distance like 7.1, 7.2 km etc. This doesn't choose different center every year.
In this case, there is no check for PREF_CUTOFF either. So even if it was problematic last year, same center will still be chosen.
Not sure if its possible for students to be not from any school(eg: homeschool). In which case they might need special center allocation.
Centers assignment for students with special needs might need to be handled separately.
The text was updated successfully, but these errors were encountered: