SavedAdd your journal

Journals / ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE / 2018 / Cilt: 6 - Sayı: 2

An ABC Algorithm Inspired by Boolean Operators for Knapsack and Lot Sizing Problems

Emrah HANCER
Pages
142–152
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results indicate that the proposed ABC-LO algorithm performs well in knapsack and lot sizing problem sets compared to the others.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This paper proposes a logically inspired artificial bee colony algorithm (ABCLO) to deal with the knapsack and lot sizing problems shown in many forms such as in economics, engineering and business.
📊
Key Findings & Data:The proposed ABC-LO algorithm aims to find fitter solutions using the search mechanism designed through the basic Boolean operators.
💡
Conclusion & Impact:The results indicate that the proposed ABC-LO algorithm performs well in knapsack and lot sizing problem sets compared to the others.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Özet

This paper proposes a logically inspired artificial bee colony algorithm (ABCLO) to deal with the knapsack and lot sizing problems shown in many forms such as in economics, engineering and business. The proposed ABC-LO algorithm aims to find fitter solutions using the search mechanism designed through the basic Boolean operators. To verify the effectiveness of the ABC-LO algorithm, it is analyzed and compared with the recent variants of particle swarm optimization, artificial bee colony and genetic algorithms. The results indicate that the proposed ABC-LO algorithm performs well in knapsack and lot sizing problem sets compared to the others.

🔖

Cite This Article

HANCER, E. (2018). An ABC Algorithm Inspired by Boolean Operators for Knapsack and Lot Sizing Problems. ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE, Cilt: 6 - Sayı: 2, 142–152. https://ajindex.com/articles/143119

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (16)

  1. Karaboga, D., Basturk, B. 2011. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39 (3), 459-471.
  2. Das, S., Biswas, S., Kundu S. 2013. Synergizing fitness learning with proximity-based food source selection in artificial bee colony algorithm for numerical optimization. Applied Soft Computing, 13 (12), 4676 - 4694. Kashan, M. H., Nahavandi, N., Kashan, A. H. 2012. DisABC: A new artificial bee colony algorithm for binary optimization. Applied Soft Computing, 12 (1), 342- 352. Kiran M. S., Gunduz M. 2013. XOR-based artificial bee colony algorithm for binary optimization. Turkish Journal of Electrical Engineering & Computer Sciences, 21 (Sup.2), 2307-2328.
  3. Pampara, G., Engelbrecht, A. P. 2011. Binary artificial bee colony optimization IEEE Symposium on Swarm Intelligence (SIS), 11-15
  4. April, Paris, 1-8
  5. Ozturk, C., Hancer, E., Karaboga, D. 2015. Dynamic Clustering with Improved Binary Artificial Bee Colony Algorithm, Applied Soft Computing, 28, 69-80.
  6. Ozturk, C., Hancer, E., Karaboga, D. 2015. A Novel Binary Artificial Bee Colony Algorithm Based on Genetic Operators, 297, 154-170
  7. Hancer, E., Xue B., Karaboga, D., Zhang, M. 2015. A binary ABC algorithm based on advanced similarity scheme for feature selection, Applied Soft Computing,36, 334-348.
  8. Andonov, R., Poirriez, V., Rajopadhye, S. 2000. Unbounded knapsack problem: Dynamic programming revisited. European Journal of Operational Research, 123 (2), 394-407.
  9. Martello, S., Toth, P. 1990. Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc. New York, NY, USA. Martello, S., Toth, P. 1999. Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science, 45 (3), 414–424.
  10. Martello, S., Toth, P. 1984. A mixture of dynamic programming and branch-and-bound for the subset-sum problem. Management Science, 30 (6), 765–771.
  11. Singh, R. P. 2011. Solving 0-1 Knapsack problem using Genetic Algorithms, 3rd IEEE International Conference on Communication Software and Networks (ICCSN), 27-29
  12. May, Xi’an, 591-595
  13. Chu, P. C., Beasley, J. E. 1998. A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics, 4 (1), 63-86
  14. AbdulHalim, M.F., Attea, B.A., Hameed, S.M. 2008. A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm. International Conference on Computer and Communication Engineering (ICCCE), 13-15
  15. May, Kuala Lumpur, 77-81.
  16. Fangguo, H. 2009