The subset sum problem is one of the most important NP complete problems. Since the problem is not a deterministic one, an artificial intelligence search techniques can help to find the answers. The problem has been solved using a novel method that uses Genetic Algorithms. Genetic algorithms are generally used for optimization problems. The work analyses the effect of changing the parameters of the algorithm on the results. The results are encouraging. This work is a continuation of one of our previous works. In order to find the gaps in the literature a review was conducted. The technique has been verified and validated using standard benchmark.