| 确定规划最短时间的遗传算法 |
| |
| 引用本文： | 欧阳继红,李岳峰,刘大有,许新滨.确定规划最短时间的遗传算法[J].吉林大学学报(理学版),1997(3). |
| |
| 作者姓名： | 欧阳继红 李岳峰 刘大有 许新滨 |
| |
| 作者单位： | 吉林大学计算机科学系!长春，130023(欧阳继红，李岳峰，刘大有)，哈尔滨制药厂计算中心!哈尔滨，150086(许新滨) |
| |
| 摘 要： | 对遗传算法中新一代的选择使用不同的策略，比较研究了所得结果．同时，对遗传算法与确定最优规划的方法做了比较．
|
| 关 键 词： | 规划 遗传算法 杂交 变异 |
A Genetic Algorithm in Determining the Shortest Time of DAI Plan |
| |
| Ouyang Jihong, Li Yuefeng, Liu Dayou.A Genetic Algorithm in Determining the Shortest Time of DAI Plan[J].Journal of Jilin University: Sci Ed,1997(3). |
| |
| Authors: | Ouyang Jihong Li Yuefeng Liu Dayou |
| |
| Abstract: | For the selection of the new generation, we used different strategies and the different results were studied and compared. Meanwhile, we compared the results of GA methods with that of getting optimum plan algorithm. |
| |
| Keywords: | planning genetic algorithm crossover mutation |
| 本文献已被 CNKI 等数据库收录！ |
