《毕业设计(论文)-基于遗传算法的课程安排优化设计》.docVIP

  • 9
  • 0
  • 约2.37万字
  • 约 25页
  • 2016-12-13 发布于贵州
  • 举报

《毕业设计(论文)-基于遗传算法的课程安排优化设计》.doc

题 目: 基于遗传算法的课程安排优化设计摘要 课程表规划问题是一个NP 完全问题,其规划策略可以通过多种方法实现,一般启发式搜索算法求相当解决方案可能需要遗传算法(GAs) 启发式方法已经成功应用人工智能遗传算法的原由Holland开发遗传算法:();()创造新()()更新的规则这些分别被称为选择,,。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

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档