This work presents an experimental comparison of the steady-state genetic algorithm to the (1+1)-evolutionary algorithm applied to the maximum vertex independent set problem. The penalty approach is used for both algorithms and tuning of the penalty function is considered in the first part of the paper. In the second part we give some reasons why one could expect the competitive performance of the (1+1)-EA. The results of computational experiment are presented.