Genetic Algorithm Solution of the Knapsack Problem Used in Finding Full Issues in the Holy Quran Based on the Number (19)

  title={Genetic Algorithm Solution of the Knapsack Problem Used in Finding Full Issues in the Holy Quran Based on the Number (19)},
  author={Fadi A. O. Najadat and Ghassan G. Kanaan and Raed Kareem Kanaan and Omar S. Aldabbas and Riyad Al-Shalabi},
  journal={Comput. Inf. Sci.},
The Holy Quran is the biggest Miracle of Muslims everywhere and at every time; therefore, it is valid for every time and place. Actually, researches and studies into the Holy Quran that aim to uncover new miracles within are considered as a kind of worship for Muslims researchers since it facilitates the Islamic mission and clarifies the vague picture of Islam throughout the world. From this perspective, the researchers have selected the vague miracle of the number 19 in the Holy Quran to… 
1 Citations

Figures and Tables from this paper



Solving the 0-1 Knapsack Problem with Genetic Algorithms

The main focus of the paper is on the implementation of the algorithm for solving the 0-1 Knapsack Problem using Genetic Algorithms, and how elitism significantly improved the performance of the roulette-wheel function.


The proposed membrane-immune algorithm, which is inspired from the structure of living cells and the vertebrate vertebrate system, is proposed, and is claimed that the proposed algorithm is very useful in solving similar combinatorial NP- complete problems.

The Multidimensional Knapsack Problem: Structure and Algorithms

The extensive computational experiments show the effectiveness of the proposed methods, which yield highly competitive results in significantly shorter run times than do previously described approaches.

Genetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems

Experiments proved that the improved algorithm with directional mutation based on greedy theory for solving large-scale 0-1 knapsack problems has high accuracy and high efficiency.

Different Approaches to Solve the 0 / 1 Knapsack Problem

The main goal of the paper is to present a comparative study of the brute force, dynamic programming, memory functions, branch and bound, greedy, and genetic algorithms applied to a single problem – the 0/1 Knapsack Problem.

A Gene Based Adaptive Mutation Strategy for Genetic Algorithms

Through tests using the one-max problem, it is shown that the proposed scheme improves convergence rate and promising results which promote further experimentation are obtained.

Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem

Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates, and the greedy GA exhibits the best performance.

Human based genetic algorithm

  • Alexander Kosorukoff
  • Computer Science
    2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236)
  • 2001
A new class of genetic algorithms (GA) is presented, based on the idea of outsourcing, which has the ability to address complex problems for which it is hard, not only to evaluate individuals, but to find a good representation for them.

BASIC - A genetic algorithm for engineering problems solution