With the increasing interest in coverage in various fields and in different circumstances such as military or environmental matters, the need has increased to improve the deployment of wireless sensors in a way that ensures the presence of the least number of sensors and maximum coverage. This problem is considered NP-hard. In this paper, we will present an experimental study in solving the problem of maximum coverage over a two-dimensional space and in the presence of heterogeneous nodes containing different sensing ranges, using the genetic algorithm. We will study the various parameters of the genetic algorithm such as selection, crossover and mutation methods. Finally, we will compare the results that give the best coverage.