集合覆盖问题的遗传算法求解方法

A new algorithms of learning from example-study of algorithms

集合覆盖问题是一个典型的NP难题,在实际中有着广泛的应用。提出一种求解该问题的改进遗传算法,通过对种群中染色体进行启发式改进和遗传参数的选取,求得最优解。

The Set covering Problem has been proved to be NP-complete problem, and it has many practical and broad applications. This paper presents a improved genetic algorithm for the set covering problem, by heuristic improvement of chromosome in population and selection of genetic parameters, find a optimal solution.