New upper bounds for sequence Covering Arrays using a 3-stage approach

作者：

Highlights：

• Three examples of applications of Sequence Covering Arrays.

• A 3-Stage approach to construct new upper bounds for Sequence Covering Arrays.

• 502 new upper bounds for SCAs for strengths 3,4,5,6,7 and 8.

• The proposed approach is compared with previous results of 12 algorithms.

摘要

•Three examples of applications of Sequence Covering Arrays.•A 3-Stage approach to construct new upper bounds for Sequence Covering Arrays.•502 new upper bounds for SCAs for strengths 3,4,5,6,7 and 8.•The proposed approach is compared with previous results of 12 algorithms.

论文关键词：Sequence Covering Arrays,Simulated annealing,Greedy algorithms,Post-optimization algorithms

论文评审过程：Received 23 August 2021, Revised 18 May 2022, Accepted 29 June 2022, Available online 2 July 2022, Version of Record 8 July 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118022