基于改进的蚁群算法的教室管理优化问题

Study of classroom management optimal problem based on improved ant colony algorithm

给出了教室管理问题的一种改进的蚁群优化方法.考虑教室容量、课间距离和单双周课程等因素,对抽象出的数据按优化方向排序,将教室管理问题简化为带权二部图的完备匹配问题;然后运用基于超立方框架的最大最小蚁群算法进行求解.为有效减少搜索空间,该算法按照教室类型对二部图结点进行分块搜索.实验表明,与基本蚁群算法相比,该算法在解决教室管理优化问题上能得到较优解.

An improved ant colony algorithm was presented in order to solve the classroom management prob-lem.This paper sorted the abstracted data along the optimized direction and turned the classroom management problem into the complete matching problem of weighted bipartite graph by analyzing the classroom capacity, the distant between classrooms,single and double week courses etc.Then,we gave optimization method using the improved Max-Min ant colony algorithm based on hyper-cube framework,which searched the node parti-tioned according to classroom type in order to reducing the searching space.Experimental results show that the improved ant system is able to construct significantly better solutions compared with ACA.