检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖北工业大学理学院 [2]北京93682部队 [3]湖北工业大学计算机学院
出 处:《计算机仿真》2008年第12期294-297,共4页Computer Simulation
摘 要:传统的手工排课的方法在效率和合理度上存在较大的缺陷。而利用单纯的遗传算法和蚁群算法则存在着计算时间过长和易导致早熟收敛等缺点。为了解决问题,将蚁群算法与遗传算法相结合,结果发现使用蚁群遗传算法,可以有效地减少搜索空间,使种群在遗传过程按规则分区,在区间中喷洒信息素,染色适应度与种群区间交互,形成正反馈系统,驱动整个算法得到排课较优解。测试结果表明,蚁群遗传算法较大提高了高校排课系统中的效率和合理度。Traditional Course schedule arrangement methods have faults in efficiency and rationality. There are some disadvantages in needing long computing time and easy to bring immature convergence when only using Ant Colony Algorithm and Genetic Algorithm. In order to solve this problem, the paper combined genetic algorithm with Ant algorithm. It is effective for reducing the searching space. According to rules, the population was divided into divisions. The fitness of chromosomes and the pheromone of divisions interact on each other, and then a positive feedback was formed. It would drive the algorithm to get a better solution of course schedule. The test result shows that G -Ant algorithm improves the efficiency and rationality in the course schedule arrangement system.
分 类 号:TP318[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40