%A YAO Ruoxia, XUE Dan, XIE Juanying, FAN Hong
%T Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
%0 Journal Article
%D 2020
%J Journal of East China Normal University(Natural Science)
%R 10.3969/j.issn.1000-5641.201921025
%P 90-98
%V 2020
%N 6
%U {https://xblk.ecnu.edu.cn/CN/abstract/article_25788.shtml}
%8
%X In order to solve 0-1 knapsack problems with greater stability and efficiency, we propose a BPSOSA-CGOO (Hybrid optimization algorithm based on the BPSO (binary particle swarm optimization), the simulated annealing (SA) algorithm and the combined greedy optimization operator (CGOO)) algorithm which is composed of the BPSO, the greedy optimization strategy, and the simulated annealing algorithm. Simulation experiments of 9 groups of different dimensions show that the BPSOSA-CGOO algorithm can solve 0-1 knapsack problems efficiently for small population sizes and iteration times. Meanwhile, it was observed that experiments performed with the algorithm can also find a better solution for 20-dimensional test data. In independent and repeated experiments, the BPSOSA-CGOO algorithm can achieve the optimal solution with high probability for both low-dimensional and high-dimensional knapsack problems; hence, stability and reliability is significantly improved when using the BPSOSA-CGOO algorithm to solve high-dimensional knapsack problems.