| 基于遗传算法的最小误工任务数问题求解 |
| |
| 引用本文： | 王艳红,张文娟.基于遗传算法的最小误工任务数问题求解[J].贵州大学学报(自然科学版),2009,26(3):25-27. |
| |
| 作者姓名： | 王艳红 张文娟 |
| |
| 作者单位： | 西安工业大学数理系,陕西,西安,710032 |
| |
| 摘 要： | 为了解决最小误工任务数问题（MTTP），将遗传算法引入该问题的求解中，基于惩罚函数。讨论了MTTP的遗传算法求解方法。并对genGA，ssGA，cGA三种演化式算法求解MTTP的实验运行结果进行分析比较，得出在解决大规模的MTTP时，genGA明显优于另两种演化式算法。
|
| 关 键 词： | 误工任务数 遗传算法 演化式算法 |
Solution of Minimum Tardy Task Problems Based on and Genetic Algorithms |
| |
| WANG Yan-hong,ZHANG Wen-juan.Solution of Minimum Tardy Task Problems Based on and Genetic Algorithms[J].Journal of Guizhou University(Natural Science),2009,26(3):25-27. |
| |
| Authors: | WANG Yan-hong ZHANG Wen-juan |
| |
| Institution: | The Department of Mathematics and Physics;Xi'an Technological University;Xi'an 710032;China |
| |
| Abstract: | In order to solve the minimum tardy task problem(MTTP),the genetic algorithm was led into the solution of it.The solution method of MTTP based on genetic algorithm was discussed by using penalty function.By analyzing and comparing the results of experimental runs of three evolutionary algorithms genGA,ssGA,cGA,it was obtained that the genGA is better than others when solving MTTP with large scale. |
| |
| Keywords: | tardy task genetic algorithm evolutionary algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
