Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
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.