毕业设计（论文）-基于遗传算法的课程安排优化设计.doc

南京师范大学本科毕业论文 运用遗传算法的课程安排优化设计 PAGE PAGE 23 题 目： 基于遗传算法的课程安排优化设计 摘要 课程表规划问题是一个NP 完全问题，其规划策略可以通过多种方法实现，一般启发式搜索算法是通过在全局区间找到可行结果，通常适合于简单的例子，对于多参数输入和结果要求，寻找一个相当好的解决方案可能需要耗费很多时间，甚至是不可能的。遗传算法(GAs) 是基于启发式方法的种群，该方法已经成功应用于人工智能、搜索和优化的各个领域，遗传算法的原理是由Holland设计并进行开发的，遗传算法具有以下特性：（1）从种群中选择个体的机制;（2）创造新个体的运算;（3）通过将以前的单个方案随机打乱，生成新解决方案的过程（4）更新个体的规则，这些特性分别被称为选择，杂交，变异，更新。本论文拟将遗传算法应用于课程表的多参数优化，寻找满足约束条件的课程规划。 关键字：课程表规划，遗传算法，选择，杂交，变异，更新 Abstract Making a class schedule is one of those NP-complete problems which can be solved by many methods. The normal heuristic search algorithm finds the optimal solution based local search procedure, but it only works for simple cases. For more complex inputs and requirements, finding a considerably good solution can take a while, or it may be impossible. Genetic algorithms (GAs) are population based heuristic approaches. They have been applied successfully in various domains of artificial intelligence, search, and optimization. The promising results were obtained for many difficult optimization problems. The principles of GAs were developed by Holland .Very briefly, GAs can be characterized by the following features: (1) a mechanism for selecting individuals from the population; (2) an operator for creating new individuals; (3) a procedure for generating new solution by random perturbations of the single previous solutions; (4) a rule for updating the population. These features are referred to as selection, crossover, mutation, and updating. In this paper, GAs will be applied to optimizing the multi-parameter of schedule and searching the schedule which satisfies the requirements . Key words: class schedule planning，genetic algorithms，selection，crossover，mutation， updating. 目录 TOC \o 1-3 \h \z \u HYPERLINK \l _Toc262644777 摘要 PAGEREF _Toc262644777 \h 1 HYPERLINK \l _Toc262644778 Abstract PAGEREF _Toc262644778 \h 2 HYPERLINK \l _Toc262644779 第一章 绪 论 PAGEREF _Toc262644779 \h 4 HYPERLINK \l _Toc262