Formation of data sets for the study of algorithms for solving the problem of covering a set

Automated generation is being considered of test data for the task of covering the set and the description of the experimental system of CJSC MKS for testing algorithms for its solution. An algorithm is proposed for generating cyclic coverage tables with specified parameters (number of rows, columns, marks) and compliance with key constraints (each row is in at least 2 columns, sets of rows/columns are not subsets of each other). The experiment system includes a web application, a microservice, and a PostgreSQL database and allows you to: generate test suites; run and test algorithms; analyze the results and generate ratings of algorithms based on the quality and speed of the solution. The approach accelerates research in the field of discrete optimization and provides the basis for the development of methods for solving the set coverage problem.

Authors: D. A. Afonskiy, P. I. Vaskin, A. A. Liss, S. A. Pavlov

Direction: Informatics, Computer Technologies And Control

Keywords: automatic data set generation, the set coverage problem, cyclic coverage table, the rules for converting coverage tables


View full article