• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Distributed computing and artificial intelligence. >Simulated Annealing for Constructing Mixed Covering Arrays
【24h】

Simulated Annealing for Constructing Mixed Covering Arrays

机译：模拟退火构造混合覆盖阵列

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Combinatorial testing is a method that can reduce costs and increase the effectiveness of software testing for many applications. It is based on constructing test-suites of economical size, which provide coverage of the most prevalent configurations of parameters. Mixed Covering Arrays (MCAs) are combinatorial structures which can be used to represent these test-suites. This paper presents a new Simulated Annealing (SA) algorithm for Constructing MCAs. This algorithm incorporates several distinguishing features including an efficient heuristic to generate good quality initial solutions, a compound neighborhood function which carefully combines two designed neighborhoods and a fine-tuned cooling schedule. The experimental evidence showed that our SA algorithm improves the obtained results by other approaches reported in the literature, finding the optimal solution in some of the solved cases.
机译：组合测试是一种可以降低成本并提高许多应用程序软件测试效率的方法。它基于构建经济规模的测试套件，从而涵盖了最流行的参数配置。混合覆盖阵列（MCA）是可用于表示这些测试套件的组合结构。本文提出了一种用于构造MCA的新的模拟退火（SA）算法。该算法结合了几个与众不同的功能，包括高效的启发式算法以生成高质量的初始解决方案，复合邻域函数，该函数将两个设计的邻域精心组合在一起，并精心调整了冷却时间表。实验证据表明，我们的SA算法通过文献中报道的其他方法改善了获得的结果，在某些已解决的情况下找到了最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号