-
Notifications
You must be signed in to change notification settings - Fork 0
This project applies a hybrid heuristic-simplex algorithm to solve for optimal school bus routes in the Boston school district. The algorithm is able to achieve O(N) time on average, compared to Simplex algorithm's O(2^N) time.
Treetion/single-school-bus-routing
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
About
This project applies a hybrid heuristic-simplex algorithm to solve for optimal school bus routes in the Boston school district. The algorithm is able to achieve O(N) time on average, compared to Simplex algorithm's O(2^N) time.
Topics
Stars
Watchers
Forks
Releases
No releases published