CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

On the Applicability of Genetic Algorithms in Subset Sum Problem

by Apeksha Oberoi, Jyoti Gupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 145 - Number 9
Year of Publication: 2016
Authors: Apeksha Oberoi, Jyoti Gupta
10.5120/ijca2016910765

Apeksha Oberoi, Jyoti Gupta . On the Applicability of Genetic Algorithms in Subset Sum Problem. International Journal of Computer Applications. 145, 9 ( Jul 2016), 37-40. DOI=10.5120/ijca2016910765

@article{ 10.5120/ijca2016910765,
author = { Apeksha Oberoi, Jyoti Gupta },
title = { On the Applicability of Genetic Algorithms in Subset Sum Problem },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2016 },
volume = { 145 },
number = { 9 },
month = { Jul },
year = { 2016 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume145/number9/25310-2016910765/ },
doi = { 10.5120/ijca2016910765 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:48:23.380301+05:30
%A Apeksha Oberoi
%A Jyoti Gupta
%T On the Applicability of Genetic Algorithms in Subset Sum Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 145
%N 9
%P 37-40
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, “Introduction to Algorithms”, the MIT Press, Cambridge, Massachusetts, USA, 2009
  2. Bhasin,H. “Algorithms” , Oxford University Press, 2015
  3. Sahni, S “Fundamentals of Computer Algorithms” Computer Science Press 1803 Research Blvd. Rockville, Maryland 20850
  4. Gerhard J. Woeginger” Exact Algorithms for NP-Hard Problems: A Survey” Combinatorial Optimization (Edmonds Festschrift), LNCS 2570, pp. 185–207,c Springer-Verlag Berlin Heidelberg 2003
  5. David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, first ed., Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA 198.
  6. Bhasin, H.; Behal, G.; Aggarwal, N.; Saini, R.K.; Choudhary, S., "On the Applicability of Diploid Genetic Algorithms in Dynamic Environments," in Soft Computing and Machine Intelligence (ISCMI), 2014 International Conference on , vol., no., pp.94-97, 26-27 Sept. 2014
  7. Bhasin,H, Behal,G ,  Aggarwal,N, Saini,R,  Choudhary.S “On the applicability of diploid genetic algorithms in dynamic environments” Springer Berlin Heidelberg 2015
  8. Bhasin, H.; Mehta. S.“On the applicability of diploid genetic algorithms” Springer Berlin Heidelberg, 28 August 2015.
  9. Goyat,S, “Cryptography Using Genetic Algorithms (GAs)” IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661 Volume 1, Issue 5 (May-June 2012), PP 06-08
  10. Bhasin,H, “Use of Genetic Algorithms for Finding Roots of Algebraic Equations”, IJCSIT, Vol. 2,Issue 4.
  11. Richards,R ”Classifier System and Genetic Algorithm” 0004-3702/89/$3.50 © 1989, Elsevier Science Publishers B.V. (North-Holland)
  12. Bhasin,H and Gitanjali , “Harnessing Genetic Algorithm for Vertex Cover Problem”, International Journal on Computer Science and Engineering (IJCSE), Vol. 1, Issue 2, pp. 218 – 223
  13. 1998 Isaac K. Evans. To appear in Evolutionary Programming VII, “Proceedings Seventh International Conference (EP98)”
Index Terms

Computer Science
Information Sciences

Keywords

Subset sum NP problems complexity Genetic Algorithms

Powered by PhDFocusTM