期刊文献+

禁忌搜索遗传算法的用例集最小化方法研究

Test Case Set Minimization with Tabu Search and Genetic Algorithm
下载PDF
导出
摘要 设计了一种以遗传算法为基础的测试用例集最小化方法,在此基础上加入了禁忌搜索技术,并且仿真对比了多种遗传算子在该算法下的执行效率,从而得出最佳遗传算子组合为禁忌搜索、锦标赛规模为2的锦标赛选择加精英选择、排名变比和多点变异。实验证明,该组合能够有效地避免陷入局部最优的情况,并极大地提高搜索效率。 A test case set minimization based on the genetic algorithm is designed. On this basis, the tabu search is combined and the efficiencies of various genetic operators in the algorithm are simulated and compared. It is found that the best genetic operator combination is tabu search, tournament selection with a size of 2 plus mutation. It is shown that the combination can search efficiency. elitist selection, rank scaling and multi-point effectively avoid the local optimum and improve the
作者 刘昕昀
出处 《电子产品可靠性与环境试验》 2012年第B05期197-202,共6页 Electronic Product Reliability and Environmental Testing
关键词 用例最小化 遗传算法 禁忌搜索 test case minimization genetic algorithm tabu search
  • 相关文献

参考文献5

  • 1IEEE-SA std610.12-1990, IEEE standard glossary of soft- ware engineering terminology [S] .
  • 2HARROLD M J. Testing: A Roadmap [C] //Finkelstein A. The Future of Software Engineering. New York: ACM Press, 2000: 61-72.
  • 3杨建军.面向组件的软件测试环境和接口变异测试方法[D].杭州:浙江大学,2001.
  • 4BUCKLAND M. AI techniques for game programming [M] . U.S.: Jones and Bartlett, 2004.
  • 5MICHALEWICZ Z, FOGEL D B. How to solve it: Modern heuristics [M] . U.S.: Springer, 2004.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部