基于约束满足和遗传算法的排课算法-计算机工程.PDF

下载文档

3
0
约1.86万字
约 4页
2019-05-02 发布于天津
举报
版权申诉
保障服务

基于约束满足和遗传算法的排课算法-计算机工程.PDF

1、本文档共4页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

36 14 2010 7 Vol.36 No.14 Computer Engineering July 2010 ·· 2010 A TP311 1 2 (1. 226007 2. 200092) Course Schedule Algorithm Based on Constraint Satisfaction and Genetic Algorithm 1 2 XU Xiu-lin , HU Ke-jin (1. Department of Electronic Engineering, Nantong Vocation College, Nantong 226007; 2. College of Economic and Management, Tongji University, Shanghai 200092) AbstractAiming at the factors of resource constraints that exist in the process of course schedule, this paper proposes an algorithm combining Genetic Algorithm(GA) and constraint satisfaction algorithm to solve course schedule problem. Course schedule tasks are sorted with constraint satisfaction algorithm, and a single course schedule task’s timetable is allocated and optimized with GA. In this algorithm, the result of single course schedule task is global optimal. Experimental results show that this method is feasible to improve the performance and the efficiency. Key wordsconstraint satisfaction algorithm; Genetic Algorithm(GA); course schedule problem 1 2 1975 S.Even NP 2 (1) (2) (2)(1) [1-2] (Genetic