论文标题
服务学院旅的重新分配问题
The Service Academy Brigade Reassignment Problem
论文作者
论文摘要
在大流行之后，由于隔离和远程学习中的学生互动降低了学生的互动，美国海军学院（USNA）的中船员旅的学生领导力发展严重降低。旅的领导决定重新分配一些从以前的公司到新公司的学生可以促进下一个学年的新领导纽带。所有2023年和2024年班的学生都将其以前的公司重新分配给有旅的重新分配问题（BRP）的新公司。 BRP的第一个目标是最大程度地减少与他们当前公司的重新分配的学生人数。第二个目标旨在根据旅的领导力定义的平均指标来改善每个公司的同质性。我们创建了三个类似的数学编程模型，以实现BRP的不同目标。第一个模型侧重于第一个目标，并迅速获得最佳解决方案。第二个模型着重于第二个目标，并获得了高质量的可行解决方案。第三个模型结合了两个目标，并在七个小时内获得了最佳解决方案。 USNA领导力从第一个模型实施了结果，将2023年和2024年的班级重新分配给了下一个学年的新公司。
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 first goal and quickly obtains an optimal solution. A second model focuses on the second goal and obtains high-quality feasible solutions. A third model combines the two goals and obtains an optimal solution within seven hours. USNA leadership implemented results from the first model to reassign the classes of 2023 and 2024 to new companies for the next academic year.
