Abstract: Subset Sum Problem (SSP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intent is to develop a generic methodology to solve all NP Complete problems via GAs thus exploring their ability to find out the optimal solution from amongst huge set of solutions. The work has been implemented and analyzed with satisfactory results.

Harsh Bhasin and Neha Singla, “Modified Genetic Algorithms Based Solution To Subset Sum Problem” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(1), 2012. http://dx.doi.org/10.14569/IJARAI.2012.010107

@article{Bhasin2012,
title = {Modified Genetic Algorithms Based Solution To Subset Sum Problem},
journal = {International Journal of Advanced Research in Artificial Intelligence},
doi = {10.14569/IJARAI.2012.010107},
url = {http://dx.doi.org/10.14569/IJARAI.2012.010107},
year = {2012},
publisher = {The Science and Information Organization},
volume = {1},
number = {1},
author = {Harsh Bhasin and Neha Singla}
}