# CombinationDesign

**Repository Path**: royxu1972/CombinationDesign

## Basic Information

- **Project Name**: CombinationDesign
- **Description**: Algorithms for Combinatorial Testing
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2015-06-05
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Combination Design

Combination Design provides some algorithms for combinatorial testing.

## generation

Generate a covering array with as few test cases as possible.

* AETG

## prioritization

Reordering existing test suite to maximize combination coverage or minimize switching cost.

* Combination coverage based prioritization

* Switching cost based prioritization
	* Greedy Algorithm
	* Dynamic Programming (optimal)
	* Genetic Algorithm
	* LKH Solver for TSP (Windows only)

* Multi Objective Optimization
	* Hybrid Based Greedy Algorithm