An Implementation of an Initial Scale in Solving Binary Knapsack Problem Using a Genetic Algorithm
In this paper, we used a new operation in a Genetic Algorithm for solving the binary Knapsack problem depending on it’s LP Relaxation solution after eliminating the fractional part of the non-binary values. The benefit is to make a filter to the initial random population from the farness of the opti...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2007-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_164015_75a093fe658afe47beeff7576b5a2e69.pdf |
| Summary: | In this paper, we used a new operation in a Genetic Algorithm for solving the binary Knapsack problem depending on it’s LP Relaxation solution after eliminating the fractional part of the non-binary values. The benefit is to make a filter to the initial random population from the farness of the optimal solution and unsuitable chromosomes. This good property will be fixed automatically in all generations in the Genetic Algorithm until reaching the optimal binary solution. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |