On the applicability of diploid genetic algorithms in dynamic environments

Bhasin, Harsh; Behal, Gitanshu; Aggarwal, Nimish; Saini, Raj Kumar; Choudhary, Shivani

doi:10.1007/s00500-015-1803-5

Cited by 15 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The future extension of this work would apply Diploid Genetic Algorithms to such instances. An extensive literature review has been carried out to understand the concept [20].Diploid Genetic Algorithms have already been applied to Travelling Salesman Problem [21,22]. …”

Section: Resultsmentioning

confidence: 99%

The Applicability of Genetic algorithm to Vertex Cover

Bhasin¹,

Amini²

2015

IJCA

Self Cite

View full text Add to dashboard Cite

The Vertex Cover Problem calls for the selection of a set of vertices(V) in a way that all the edges of the graph, connected to those vertices constitute the set E of the given graph G= (V, E). The problem finds applications in various fields and is therefore, one of the most widely researched topics in NP Complete Problems. The problem is an NP Complete problem this work proposes a Genetic Algorithm based solution to handle the problem. The proposed algorithm has been implemented and tested for various graphs. These instances vary in the number of vertices and connectivity. The results are encouraging. This paper also explores the available techniques in order to put the things in the perspective. The future scope of this work intends to apply Diploid Genetic Algorithms to the problem to incorporate robustness into the proposed algorithm.

show abstract

Section: Resultsmentioning

confidence: 99%

The Applicability of Genetic algorithm to Vertex Cover

Bhasin¹,

Amini²

2015

IJCA

Self Cite

View full text Add to dashboard Cite

show abstract

“…The next step would be to implement the problem using Diploid Genetic Algorithms. The implementation for Diploid has been done and an extensive literature review has also been carried out [7]. The Diploid Genetic Algorithms are known for their robustness.…”

Section: Conclusion and Future Scopementioning

confidence: 99%

On the Applicability of Genetic Algorithms in Subset Sum Problem

Oberoi¹,

Gupta²

2016

IJCA

View full text Add to dashboard Cite

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.

show abstract

“…It may also be stated here that, the total number of solutions is taken as the criteria of goodness. The above experiment is now being carried out using Diploid Genetic Algorithms in order to test the method in dynamic environments [22]. Moreover, the number of samples in the new experiment is increased to 100.…”

Section: Conclusion and Future Scopementioning

confidence: 99%

Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic Algorithms

Singh¹

2016

IJCA

View full text Add to dashboard Cite

Cryptanalysis of knapsack cipher is a fascinating problem which has eluded the computing fraternity for decades. However, in most of the cases either the time complexity of the proposed algorithm is colossal or an insufficient number of samples have been taken for verification. The present work proposes a Genetic Algorithm based technique for cryptanalysis of knapsack cipher. The experiments conducted prove the validity of the technique. The results prove that the technique is better than the existing techniques. An extensive review has been carried out in order to find the gaps in the existing techniques. The work paves the way of the application of computational intelligence techniques to the discipline of cryptanalysis.

show abstract

On the applicability of diploid genetic algorithms in dynamic environments

Cited by 15 publications

References 6 publications

The Applicability of Genetic algorithm to Vertex Cover

The Applicability of Genetic algorithm to Vertex Cover

On the Applicability of Genetic Algorithms in Subset Sum Problem

Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic Algorithms

Contact Info

Product

Resources

About