Back to Search Start Over

Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm

Authors :
Armaneesa Naaman Hasoon
Source :
Tikrit Journal of Pure Science. 23:137-142
Publication Year :
2023
Publisher :
Tikrit University, 2023.

Abstract

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 best investment plan which achieve the highest profits within a determined costs, this plan is one of the applications of the financial field. The result from the proposed algorithm implemented by matlab (8.3) show the ability to find best solution with precisely and rapidity compared to genetic algorithm http://dx.doi.org/10.25130/tjps.23.2018.039

Details

ISSN :
24151726 and 18131662
Volume :
23
Database :
OpenAIRE
Journal :
Tikrit Journal of Pure Science
Accession number :
edsair.doi.dedup.....40fb82fae9082ac618af4cbedb6b34e9