Bhasin (2012) Modified Genetic Algorithms Based Solution To Subset Sum Problem

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

Modified Genetic Algorithms Based Solution To Subset Sum Problem

Post a Comment

CONTRIBUTORS:

Author:

Bhasin, Harsh (Delhi technological University)

JOURNAL:

International Journal of Advanced Research In Artificial Intelligence, 1(1), 38 - 41.

YEAR:

2012

PUB TYPE:

Journal Article

SUBJECT(S):

Subset Sum problem, NP Hard Problems, Artificial intelligence, Genetic Algorithms

DISCIPLINE:

Computer Science

HTTP:

https://thesai.org/Downloads/IJARAI/Volume1No1/Paper7-Modified_Genetic_Algorithms_Based_Solution_To_Subset_Sum_Problem.pdf

LANGUAGE:

English

PUB ID:

103-501-506 (Last edited on 2012/04/11 21:47:07 GMT-6)

SPONSOR(S):

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

STATISTICS

Click on # to view
Citations		0
References		0
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		2/160

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next