论文部分内容阅读
最大独立子集问题是组合优化问题中的一个重要问题,该问题是一个NP难题,其目标是在一个环图中找到一个最大的独立子集.提出了一种改进的遗传算法来解决这个问题,用一种基于条件的遗传算子来代替通常的基于概率的遗传算子.实验结果表明提出的算法是有效的.
The maximal independent subset problem is an important problem in the combinatorial optimization problem, which is an NP puzzle whose goal is to find a largest independent subset in a ring diagram. An improved genetic algorithm is proposed to solve this problem , A conditional genetic operator is used instead of the usual probability-based genetic operator.The experimental results show that the proposed algorithm is effective.