- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
An Implementation of an Initial Scale in Solving Binary Knapsack Problem Using a Genetic Algorithm | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 4, Volume 4, Issue 2, 2007, Pages 43-57 PDF (345.76 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2007.164015 | ||
| Authors | ||
| Abbas Y. Al-Bayati1; Nawar N. Qubat2 | ||
| 1College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq | ||
| 2College of Computer sciences and Mathematics University of Mosul/Iraq | ||
| Abstract | ||
| 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. | ||
| Keywords | ||
| genetic algorithm; binary Knapsack problem; LP Relaxation solution | ||
|
Statistics Article View: 310 PDF Download: 257 |
||