The Service Academy Brigade Reassignment Problem
Gary Lazzaro, Jay Foraker, Rob Curry

TL;DR
This paper formulates and solves the Brigade Reassignment Problem at USNA to optimize student reassignments, aiming to enhance leadership bonds and company homogeneity after COVID disruptions.
Contribution
It introduces three mathematical programming models to effectively address different objectives of the brigade reassignment process.
Findings
Optimal solutions for minimizing reassignments
High-quality feasible solutions for homogeneity
Combined model achieves optimal solutions within hours
Abstract
After the COVID pandemic, student leadership development within the brigade of midshipmen at the United States Naval Academy (USNA) was severely degraded due to reduced student interaction from isolation and remote learning. Brigade leadership decided that reassignment of some students from their previous companies to new companies could facilitate new leadership bonds for the next academic year. All students in the classes of 2023 and 2024 are reassigned from their previous companies to new companies with the Brigade Reassignment Problem (BRP). The first goal of BRP is to minimize the number of students reassigned to their current company. The second goal seeks to improve the homogeneity of each company in terms of average metrics defined by brigade leadership. We create three similar mathematical programming models to achieve different goals of the BRP. The first model focuses on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Education and Military Integration · Quality and Supply Management
