Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation.

A number of greedy algorithms have been conducted for covering array construction, and most of them can be integrated into a framework, and more approaches can be derived from the framework. However, such a framework is affected by many factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we design Base Choice experiments based on six decisions of the framework to study systematically, providing theoretical and practical guideline for the design and optimization of the greedy algorithms.