Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
Article Sidebar
Main Article Content
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
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
1- M. shokouhifar, F. Farokhi, " Feature selection using supervised fuzzy C-Means algorithm with anty colony optimization", 3 rd international conference on machine vision (ICMV), 2010.
2- D. Pisinger, "Algorithms for knapsack problems", PhD. Thesis, university of Copenhagen, Denmark, 1995.
3- B. Zhao, C. Deng, Y. Yang, H. Peng, " Novel binary biography based optimization algorithm for knapsack problem", Springer, pp. 217-224, 2012.
4- S. Sabet, F. Farokhi, M. Shokouhifar, " A novel artificial bee colony algorithm for the knapsack problem", IEEE conf., 2012.
5- M. Gupta, " A fast and efficient genetic algorithm to solve 0-1 knapsack problem", International journal of digital application & contemporary research, vol. 1, Issue 6, 2013.
6- R. Spillman, " Solving large knapsack problems with a genetic algorithm", IEEE, 1995.
7- Y. Liang, L. Liu,D. Wang, R. Wu, " particle swarm optimization to solve knapsack problem", springer, ICICA 105, pp.437-443, 2010.
8- Z. Hu, R. Li, " Ant colony optimization algorithm for the 0-1 knapsack problem based on genetic algorithm", advanced materials research, vol. 230-232, pp.973-977, 2011.
9- D. Karboga, " An idea based on honey bee swarm for numerical optimization", (Technical Report- TR-06) , Turkey, 2005.
10- S. Sabet, F. Farokhi, M. Shokouhifar, " A discrete artificial bee colony for multiple knapsack problem", International journal reasoning based intelligent systems, vol.5, no.2, 2013.
11- S. Soleymani, A. Hatamloo, " To solve knapsack problem using bee algorithm", International academic journal of science and engineering, vol.2, no.11, pp.23-30, 2015.
12- B. Akay, D. Karaboga, "A modified Artificial Bee Colony algorithm for real-parameter optimization", Information Sciences 192 , 2012.
13- G. Tankasala, "Artificial bee colony optimization for economic load dispatch of a modern power system", International journal of scientific & engineering research, vol.3, Issue.1, 2012.
14- F. Abo-Mouti, M. El-Hawary, "overview of artificial bee colony (ABC) algorithm and its application", IEEE, 2012.
15- J. Ji, H. Wei, C. Liu, B. Yin, "Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem", hindwai publishing corporation, mathematical problems in engineering, vol. 2013.