Finding a Near-Maximum Independent Set of a Circle Graph by Using Genetic Algorithm with Conditional Genetic Operators

摘要

The maximum independent set problem is of central importance combinatorial optimization problem. It has many practical applications in science and engineering. In this paper, we propose a genetic algorithm based approach to solve the problem. In the proposed approach, the genetic operators are performed basing on condition instead of probability. The proposed algorithm is tested on a large number of instances and the simulation results show that the proposed method is superior to its competitors.