This poster deals with a subset of students with disabilities in the Boston Public Schools (BPS) system that require a designated monitor (supervisor) to ride the school bus with them. Monitors can ride several bus routes in a given day as long as predetermined rules are satisfied. BPS constructs packages of routes for monitors to make their bids at the beginning of the academic year, with a goal of maximizing the number of routes per package. For a given academic year, BPS manages approximately 3,500 routes scheduled for 625 buses and about 1,350 students requiring different types of monitors. Given the high complexity ofthis combinatorial problem, an automated system is required in order to solve the problem optimally while satisfying all rules. In this presentation, we discuss the different mathematical formulations and algorithms that were implemented to solve this problem, and we assess the pros and cons of each approach.
This paper reviews the capabilities of the solveBlackbox action, introduced in SAS Optimization 8.5 in SAS Viya 3.5, and explores several examples of its use in a variety of settings.
This paper demonstrates an approach for Python programmers to naturally model their optimization problems, solve them by using SAS Optimization solver actions, and view and interact with the results.