- 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
Meta-heuristic Optimization Algorithms in Multidimensional Knapsack Problem using bat algorithm: A subject review | ||
| College Of Basic Education Research Journal | ||
| Article 23, Volume 20, Issue 2.1, August 2024, Pages 454-464 PDF (783.55 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/berj.2024.184192 | ||
| Author | ||
| Rana Bashar Hussein* | ||
| Department of Management Information Systems / College of Administration and Economics / University of Mosul | ||
| Abstract | ||
| The multi-dimensional investor or backpack problem is an important and well-known difficult constrained combinatorial optimization problem in operations research and optimization. Nowadays, algorithms inspired by nature have become extremely important in solving many mathematical problems, including the investor’s portfolio problem. In order to reach the best solutions, this research reviewed the bat algorithm and the updates that occurred to it in solving this problem. | ||
|
Statistics Article View: 151 PDF Download: 69 |
||