Skip to main content
SpringerLink
Log in

A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems

  • Conference paper
  • First Online:
Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications (ECC 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 682))

Abstract

0-1 knapsack problems (KPs) is a typical NP-hard problem in combinatorial optimization problem. For the sake of efficiency, it becomes increasingly popular for researchers to apply heuristic techniques to solve the 0-1 KPs. Due to its simplicity and convergence speed, an increasing number of techniques based on binary particle swarm optimization (BPSO) has been presented. However, BPSO-based techniques suffered from a major shortcoming which is the premature convergence of a swam. To address the problem, this paper proposed a hybrid BPSO-GA algorithm which combines the strengths of BPSO and genetic algorithm (GA). Experimental results show that our proposal is able to find more optimal solutions than BPSO-based algorithm.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Notes

  1. 1.

    http://www.math.mtu.edu/kreher/cages/Data.html.

References

  1. Rooderkerk, R.P., Heerde, H.J.V.: Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization. Eur. J. Oper. Res. 250(3), 842–854 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Muller, S., Al-Shatri, H., Wichtlhuber, M., Hausheer, D.: Computation offloading in wireless multi-hop networks: energy minimization via multi-dimensional knapsack problem. In: IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications, vol. 51, no. 43, pp. 1717–1722 (2015)

    Google Scholar 

  3. Jacko, P.: Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. Ann. Oper. Res. 241(1), 83–107 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Li, K., Liu, J., Wan, L., Yin, S., Li, K.: A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementations. Parallel Comput. 43(C), 27–42 (2015)

    Article  MathSciNet  Google Scholar 

  5. Kuchta, D., Ryca, R., Skorupka, D., Duchaczek, A.: The use of the generalised knapsack problem in computer aided strategic management. In: International Conference on Enterprise Information Systems, Wroclaw, Poland, pp. 39–46 (2016)

    Google Scholar 

  6. Lv, J., Wang, X., Huang, M., Cheng, H., Li, F.: Solving 0–1 knapsack problem by greedy degree and expectation efficiency. Appl. Soft Comput. 41(C), 94–103 (2016)

    Article  Google Scholar 

  7. Zhang, Y., Wang, S., Ji, G.: A comprehensive survey on particle swarm optimization algorithm and its applications. Math. Probl. Eng. 2015(1), 1–38 (2015)

    MathSciNet  Google Scholar 

  8. Liu, J., Mei, Y., Li, X.: An analysis of the inertia weight parameter for binary particle swarm optimization. IEEE Trans. Evol. Comput. 39, 43–47 (2015)

    Google Scholar 

  9. Frans, V.D.B., Engelbrecht, A.P.: A cooperative approach to particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 225–239 (2004)

    Article  Google Scholar 

  10. Holland, J.H.: Adaptation in Natural and Artificial System. MIT Press, Cambridge (1975). vol. 6, no. 2, pp. 126–137

    Google Scholar 

  11. Settles, M., Soule, T.: Breeding swarms: a ga/pso hybrid. In: Conference on Genetic and Evolutionary Computation, Washington DC, USA, pp. 161–168 (2005)

    Google Scholar 

Download references

Acknowledgment

This work is supported by National Natural Science Foundation of China (61402108, 61503082), Foundation for Scientific Research of Fujian Education Committee (GY-Z15121, JA13211), Foundation of Fujian University of Technology (GY-Z15101, GY-Z14068, GY-Z13113), Key Project of Fujian Province Department of Science & Technology (2013H0002).

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Fujian University of Technology, No. 3 Xueyuan Road, University Town, Fuzhou, 350118, Fujian, China

    Jinshui Wang, Jianhua Liu, Jeng-Shyang Pan & Xingsi Xue

  2. Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, No. 3 Xueyuan Road, University Town, Fuzhou, 350118, Fujian, China

    Jinshui Wang, Jianhua Liu, Jeng-Shyang Pan & Xingsi Xue

  3. College of Ecological Environment and Urban Construction, Fujian University of Technology, No. 3 Xueyuan Road, University Town, Fuzhou, 350118, Fujian, China

    Lili Huang

Authors
  1. Jinshui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianhua Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeng-Shyang Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xingsi Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lili Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinshui Wang .

Editor information

Editors and Affiliations

  1. Department of Computer Science, VÅ B-Technical University of Ostrava , Ostrava-Poruba, Czech Republic

    Pavel Krömer

  2. Dept. Lenguajes y Ciencias de la Computación, University of Málaga, Málaga, Spain

    Enrique Alba

  3. Fujian University of Technology, Fuzhou, Fujian, China

    Jeng-Shyang Pan

  4. Department of Computer Science, VÅ B-Technical University of Ostrava, Ostrava-Poruba, Czech Republic

    Václav Snášel

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Wang, J., Liu, J., Pan, JS., Xue, X., Huang, L. (2018). A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems. In: Krömer, P., Alba, E., Pan, JS., Snášel, V. (eds) Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications. ECC 2017. Advances in Intelligent Systems and Computing, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-68527-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68527-4_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68526-7

  • Online ISBN: 978-3-319-68527-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation