Skip to main content
SpringerLink
Log in
Book cover

International Conference on Swarm Intelligence

ICSI 2018: Advances in Swarm Intelligence pp 153–165Cite as

New Binary Artificial Bee Colony for the 0-1 Knapsack Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10941))

Abstract

The knapsack problem is one of the well known NP-Hard optimization problems. Because of its appearance as a sub-problem in many real world problems, it attracts the attention of many researchers on swarm intelligence and evolutionary computation community. In this paper, a new binary artificial bee colony called NB-ABC is proposed to solve the 0-1 knapsack problem. Instead of the search operators of the original ABC, new binary search operators are designed for the different phases of the ABC algorithm, namely the employed, the onlooker and the scout bee phases. Moreover, a novel hybrid repair operator called (HRO) is proposed to repair and improve the infeasible solutions. To assess the performance of the proposed algorithm, NB-ABC is compared with two other existing algorithms, namely GB-ABC and BABC-DE, for solving the 0-1 knapsack problem. Based on a set of 15 0-1 high dimensional knapsack problems classified in three categories. the experimental results in view of many criteria show the efficiency and the robustness of the proposed NB-ABC.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32, 2271–2284 (2005)

    Article  MathSciNet  Google Scholar 

  2. Reniers, G.L., Sörensen, K.: An approach for optimal allocation of safety resources: using the knapsack problem to take aggregated cost-efficient preventive measures. Risk Anal. 33, 2056–2067 (2013)

    Article  Google Scholar 

  3. Mavrotas, G., Diakoulaki, D., Kourentzis, A.: Selection among ranked projects under segmentation, policy and logical constraints. Eur. J. Oper. Res. 187, 177–192 (2008)

    Article  Google Scholar 

  4. Peeta, S., Salman, F.S., Gunnec, D., Viswanath, K.: Pre-disaster investment decisions for strengthening a highway network. Comput. Oper. Res. 37, 1708–1719 (2010)

    Article  Google Scholar 

  5. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)

    Google Scholar 

  6. Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8, 687–697 (2008)

    Article  Google Scholar 

  7. Kiran, M.S.: The continuous artificial bee colony algorithm for binary optimization. Appl. Soft Comput. 33, 15–23 (2015)

    Article  Google Scholar 

  8. Ozturk, C., Karaboga, D., Gorkemli, B.: Probabilistic dynamic deployment of wireless sensor networks by artificial bee colony algorithm. Sensors 11, 6056–6065 (2011)

    Article  Google Scholar 

  9. Liu, W., Niu, B., Chen, H.N.: Binary artificial bee colony algorithm for solving 0-1 knapsack problem. Adv. Inf. Sci. Serv. Sci. 4(22), 464–470 (2012)

    Google Scholar 

  10. Ozturk, C., Hancer, E., Karaboga, D.: A novel binary artificial bee colony algorithm based on genetic operators. Inf. Sci. 297, 154–170 (2015)

    Article  MathSciNet  Google Scholar 

  11. Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997)

    Article  MathSciNet  Google Scholar 

  12. Cao, J., Yin, B., Lu, X., Kang, Y., Chen, X.: A modified artificial bee colony approach for the 0–1 knapsack problem. Appl. Intell. 48, 1582–1595 (2017)

    Article  Google Scholar 

  13. Banitalebi, A., Aziz, M.I.A., Aziz, Z.A.: A self-adaptive binary differential evolution algorithm for large scale binary optimization problems. Inf. Sci. 367, 487–511 (2016)

    Article  Google Scholar 

  14. Derrac, J., García, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1, 3–18 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the National Natural Science Foundation of China (No. 61672215, U1613209).

Author information

Authors and Affiliations

  1. The College of Computer Science and Electronic Engineering, Hunan University, Changsha, China

    Mourad Nouioua & Zhiyong Li

  2. Key Laboratory for Embedded and Network Computing of Hunan Province, Changsha, China

    Mourad Nouioua & Zhiyong Li

  3. PKU-HKUST Shenzhen-HongKong Institution, Shenzhen, China

    Shilong Jiang

Authors
  1. Mourad Nouioua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiyong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shilong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiyong Li .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Southern University of Science and Technology, Shenzhen, China

    Yuhui Shi

  3. Tongji University, Shanghai, China

    Qirong Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nouioua, M., Li, Z., Jiang, S. (2018). New Binary Artificial Bee Colony for the 0-1 Knapsack Problem. In: Tan, Y., Shi, Y., Tang, Q. (eds) Advances in Swarm Intelligence. ICSI 2018. Lecture Notes in Computer Science(), vol 10941. Springer, Cham. https://doi.org/10.1007/978-3-319-93815-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93815-8_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93814-1

  • Online ISBN: 978-3-319-93815-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation