基于拟人策略的高校排课算法研究  

Research on College Course Scheduling Algorithm Based on personification Strategy

作　　者：郝世选[1] 

机构地区：[1]濮阳职业技术学院数学与信息工程系,河南濮阳457000

出　　处：《软件导刊》2008年第8期64-65,共2页Software Guide

摘　　要：排课问题早在70年代就被证明是一个NP完全问题,即算法的计算时间是呈指数增长的,这一论断确立了排课问题的理论深度。对于NP完全问题,目前在数学上还没有一个通用的算法能够很好地解决。拟人策略算法结合了多种高校排课算法实例和多年的实际排课经验,与其它算法相比,有效地避免了以往算法的高时间复杂度和高空间复杂度,简单易行,便于程序实现。Course arrangement in the early 1970s proved to be an NP-complete problem, the calculation algorithm is increasing exponentially, and this inference established a theoretical basis for it. There is no universal algorithm to NP-complete problem in mathematics. The simulation algorithm we study combines many kinds of high college course arrangement examples and many years＇ practical course arrangement experiences. Compared with other algorithms, it effectively avoids high complexity of time and space before. It is easy for us to put it into practice and convenient to be programmed.

关 键 词：高校 排课 拟人策略算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]