Solving set union knapsack problems with adaptive binary artificial bee colony

Durgut, Rafet; Yavuz, ?lim; Aydin, Mehmet

Abstract

Meta-heuristic and swarm intelligence algorithms have long been used to provide approximate solutions to NP-Hard optimization problems. Especially when it comes to combinatorial and binary problems, operator functions used to generate neighbor solutions embedded in algorithms play an important role in the success of algorithms while imposing limitations on the variety of search. To avoid such limitations and improve diversity, it is preferable to use multiple operators via a selection scheme rather than a single operator. Previously, using a set of operator selection schemes to solve various combinatorial problems with different swarm intelligence and meta-heuristic algorithms has been used to achieve higher efficiency. In this article, set-join knapsack problems, for the first time, It is solved by a binary artificial bee colony algorithm with multiple operators selected through alternative operator selection schemes. Different loan assignment approaches, different sliding window sizes and parameter configurations are tested for the proposed method. The properties of selection schemes are extensively studied on 30 comparison problems. The best performing algorithm configuration is proposed for these problem sets. The study presents an adaptive binary artificial bee colony algorithm with a successful selection scheme. The properties of selection schemes are extensively studied on 30 comparison problems. The best performing algorithm configuration is proposed for these problem sets. The study presents an adaptive binary artificial bee colony algorithm with a successful selection scheme. The properties of selection schemes are extensively studied on 30 comparison problems. The best performing algorithm configuration is proposed for these problem sets. The study presents an adaptive binary artificial bee colony algorithm with a successful selection scheme.

Citation

Durgut, R., Yavuz, İ., & Aydin, M. (2021). Solving set union knapsack problems with adaptive binary artificial bee colony. Journal of Intelligent Systems: Theory and Applications, 4(1), 43-54. https://doi.org/10.38016/jista.854584

• Journal Article Type: Article
• Acceptance Date: Feb 20, 2021
• Online Publication Date: Mar 24, 2021
• Publication Date: Mar 24, 2021
• Deposit Date: Aug 17, 2021
• Publicly Available Date: Aug 18, 2021
• Journal: Journal of Intelligent Systems: Theory and Applications
• Peer Reviewed: Peer Reviewed
• Volume: 4
• Issue: 1
• Pages: 43-54
• DOI: https://doi.org/10.38016/jista.854584
• Public URL: https://uwe-repository.worktribe.com/output/7637110