Advertisement

Improved Bat Algorithm for Multiple Knapsack Problems

  • Sicong Li
  • Saihua Cai
  • Ruizhi SunEmail author
  • Gang Yuan
  • Zeqiu Chen
  • Xiaochen Shi
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1042)

Abstract

Bat algorithm has been paid more attention because of its excellent conversion ability between global search to local search and its high robustness. To solve the problem of 0–1 single knapsack problem, scholars introduced binary encoding on the basis of bat algorithm and put forward the binary bat algorithm. However, when solving the multiple knapsack problem (MKP), the binary encoding will lead to the emergence of illegal solutions, so it is necessary to use the multi-value encoding to re-model the MKP, thereby applying the bat algorithm to MKP. To improve the entire search ability of the algorithm, we optimized the effective solution in the algorithm using the greedy algorithm, and then proposed a greedy algorithm-based bat algorithm, namely MKBA-GA, for solving the MKP. To further improve the solution ability of the MKBA-GA algorithm, we used Single Running Technique (SRT) to optimize the effective solution, and then proposed an efficient SRT-based bat algorithm called MKBA-SRT. In order to verify the performance of the proposed MKBA-GA algorithm and MKBA-SRT algorithm, we compare them with BBA, IRT and SRT algorithms on twelve datasets, and the experimental results show that the solution ability of MKBA-GA algorithm is stronger than that of BBA algorithm, and the ability of MKBA-SRT algorithm is superior to that of other four compared algorithms on eleven datasets.

Keywords

Bat algorithm Multiple knapsack problem Multi-value encoding Greedy algorithm Single running technique 

References

  1. 1.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004).  https://doi.org/10.1007/978-3-540-24777-7CrossRefzbMATHGoogle Scholar
  2. 2.
    Sitarz, S.: Multiple criteria dynamic programming and multiple knapsack problem. Appl. Math. Comput. 228, 598–605 (2014)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Laalaoui, Y.: Improved swap heuristic for the multiple knapsack problem. In: Rojas, I., Joya, G., Gabestany, J. (eds.) IWANN 2013. LNCS, vol. 7902, pp. 547–555. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-38679-4_55CrossRefGoogle Scholar
  4. 4.
    Xiong, W., Wei, P., Jiang, B.: Binary ant colony algorithm with congestion control strategy for the 0/1 multiple knapsack problems. In: 8th World Congress on Intelligent Control and Automation, pp. 3296–3301. IEEE, Jinan (2010)Google Scholar
  5. 5.
    Liu, Q., Odaka, T., Kuroiwa, J., Shirai, H., Ogura, H.: A new artificial fish swarm algorithm for the multiple knapsack problem. IEICE Trans. Inf. Syst. D 3, 455–468 (2014)CrossRefGoogle Scholar
  6. 6.
    Fukunaga, A., Tazoe, S.: Combining multiple representations in a genetic algorithm for the multiple knapsack problem. In: 2009 IEEE Congress on Evolutionary Computation, pp. 2423+. IEEE, Trondheim (2009)Google Scholar
  7. 7.
    Rizk-Allah, R., Hassanien, A.: New binary bat algorithm for solving 0–1 knapsack problem. Complex Intell. Syst. 4(1), 31–53 (2017)CrossRefGoogle Scholar
  8. 8.
    Bangyal, W., Ahmad, J., Rauf, H.: Optimization of neural network using improved bat algorithm for data classification. J. Med. Imaging Health Inform. 9(4), 670–681 (2019)CrossRefGoogle Scholar
  9. 9.
    Huang, L., Wang, P., Liu, A., Nan, X., Jiao, L., Guo, L.: Indoor three-dimensional high-precision positioning system with bat algorithm based on visible light communication. Appl. Opt. 58(9), 2226–2234 (2019)CrossRefGoogle Scholar
  10. 10.
    Fusai, D.: The application research of improved bat algorithm based on chaos for job shop scheduling. In: 3rd Workshop on Advanced Research and Technology in Industry Applications, Guilin, China, pp. 353–356 (2017)Google Scholar
  11. 11.
    Gan, C., Cao, W., Wu, M., Chen, X.: A new bat algorithm based on iterative local search and stochastic inertia weight. Expert Syst. Appl. 104, 202–212 (2018)CrossRefGoogle Scholar
  12. 12.
    Chakri, A., Khelif, R., Benouaret, M., Yang, X.: New directional bat algorithm for continuous optimization problems. Expert Syst. Appl. 69, 159–175 (2017)CrossRefGoogle Scholar
  13. 13.
    Mirjalili, S., Mirjalili, S.M., Yang, X.: Binary bat algorithm. Neural Comput. Appl. 25(3–4), 663–681 (2014)CrossRefGoogle Scholar
  14. 14.
    Zhou, Y., Bao, Z., Luo, Q., Zhang, S.: A complex-valued encoding wind driven optimization for the 0–1 knapsack problem. Appl. Intell. 46(3), 684–702 (2017)CrossRefGoogle Scholar
  15. 15.
    Huang, X., Zeng, X., Han, R.: Dynamic inertia weight binary bat algorithm with neighborhood search. Comput. Intell. Neurosci. 8, 1–15 (2017)Google Scholar
  16. 16.
    Pisinger, D.: An exact algorithm for large multiple knapsack problems. Eur. J. Oper. Res. 114(3), 528–541 (1999)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Sicong Li
    • 1
  • Saihua Cai
    • 1
  • Ruizhi Sun
    • 1
    • 2
    Email author
  • Gang Yuan
    • 1
  • Zeqiu Chen
    • 1
  • Xiaochen Shi
    • 1
  1. 1.College of Information and Electrical EngineeringChina Agricultural UniversityBeijingChina
  2. 2.Scientific Research Base for Integrated Technologies of Precision Agriculture (Animal Husbandry), The Ministry of AgricultureBeijingChina

Personalised recommendations