| 注册
首页|期刊导航|计算机与现代化|基于优化初始种群的自动组卷算法

基于优化初始种群的自动组卷算法

唐永红 龚安 王超

计算机与现代化Issue(7):38-40,43,4.
计算机与现代化Issue(7):38-40,43,4.DOI:10.3969/j.issn.1006-2475.2012.07.010

基于优化初始种群的自动组卷算法

Automatic Generation Algorithms Based on Optimization Initial Population

唐永红 1龚安 1王超1

作者信息

  • 1. 中国石油大学(华东),山东青岛266580
  • 折叠

摘要

Abstract

Aiming at the uncertainty of initial population of the genetic algorithm and the improved genetic algorithm, this paper proposes an optimized initial generation genetic algorithm. Firstly the algorithm finds the local optimized solution, then different types of solutions random combinations, gets the formation of initial generation of genetic algorithm. The next, an optimal solution by genetic crossover and single-point mutation is got. Finally, the algorithm is applied to the automatic generation of database systems course. The results show that the method has good efficiency to the examination paper, the requirements of the examination paper can be well positioned to meet.

关键词

遗传算法/优化初始种群/单点变异/自动组卷

Key words

genetic algorithms/ optimizing the initial population/ single point mutation/ automatic generation

分类

信息技术与安全科学

引用本文复制引用

唐永红,龚安,王超..基于优化初始种群的自动组卷算法[J].计算机与现代化,2012,(7):38-40,43,4.

计算机与现代化

OACSTPCD

1006-2475

访问量0
|
下载量0
段落导航相关论文