Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
One of the combinatorial optimization problems is Knapsack problem, which aims to maximize the benefit of objects whose weight not exceeding the capacity of knapsack. This paper introduces artificial bee colony algorithm to select a subset of project and represented by knapsack problem to put the b...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2023-01-01
|
| Series: | Tikrit Journal of Pure Science |
| Subjects: | |
| Online Access: | https://tjpsj.org/index.php/tjps/article/view/662 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|