Abstract
The authors discuss how Boston Public Schools (BPS) and a team from Massachusetts Institute of Technology addressed the BPS bus routing problem. They developed an algorithm that decomposes and separately solves subproblems of assigning students to bus stops, assigning stops to bus trips, and connecting trips into an itinerary for each bus.
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 callDisclaimer: 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.
