基于整数规划和0-1背包问题的宿舍集中化管理分配方案——以桂林电子科技大学为例

Centralized Management and Allocation Scheme of Dormitory Based on Integer Programming and 0-1 Backpack Problem——Taking Guilin University of Electronic Technology as an Example

为解决校园宿舍资源合理分配问题,满足各学院学生住宿相对集中化、方便学校进行管理等方面的需求,由此提出了关于高校宿舍集中化管理分配方案的研究。该研究以桂林电子科技大学为例,通过收集并计算宿舍和学生数据,使用0-1整数规划对男女生宿舍分布情况进行计算,在此基础上运用0-1背包问题为各个学院安排宿舍,并讨论了研究生搬进花江校区的分配方案,以达到学生集中化管理和宿舍最大化利用的目的。结果表明,该理论研究对校园学生公寓分配问题具有较好的优化作用。

In order to solve the problem of reasonable allocation of campus dormitory resources,to meet the needs of relative centralization of students'accommodation and facilitate school management,this paper puts forward the research on the centralized management and distribution scheme of college dormitory.Taking Guilin University of Electronic Science and technology as an example,through the collection and calculation of dormitory and student data,0-1 integer programming is used to calculate the distribution of male and female dormitory.On this basis,0-1 knapsack problem is used to arrange dormitories for each college,and the allocation scheme of graduate students moving into Huajiang campus is discussed,so as to achieve the goal of centralized management of students and maximum utilization of dormitory.The results show that the theoretical research has a good optimization effect on the allocation of campus students'apartments.