1. Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
- Author
-
Armaneesa Naaman Hasoon
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,Computer science ,Combinatorial optimization problem ,Investment plan ,02 engineering and technology ,General Medicine ,Field (computer science) ,Artificial bee colony algorithm ,020901 industrial engineering & automation ,Knapsack problem ,Genetic algorithm ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,MATLAB ,computer ,Selection (genetic algorithm) ,computer.programming_language - 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
- Published
- 2023
- Full Text
- View/download PDF