遗传算法优化求解排课问题的应用研究  

Applied Research Genetic Algorithm Optimization Sowing Timetabing Problem

作　　者：王仲华[1] 卢娇丽[2] 

机构地区：[1]太原师范学院,山西太原030012 [2]山西大学,山西太原030006

出　　处：《科学之友（中）》2008年第6期17-18,20,共3页Friend of Science Amateurs

摘　　要：排课问题是一个有约束的、多目标的组合优化问题,并且已经被证明为一个NP完全问题,运用计算机进行自动排课既是高校教务管理的迫切需要,同时也有重要的理论意义,本文的目的就是要找到一种解决这种复杂问题的方法。Timetabling Problem （TrP） is a Multi-objective Combination Optimization Problem with constraints, and also has been proved NP-Completed; It is the demand researching that complete solved completely for its of both university education management and theory the table scheduling with computers. The purpose of this paper is to try another way to solve the complex problem.

关 键 词：遗传算法 排课 组合优化 测试 

分 类 号：P338[天文地球—水文科学]