Advertisement

A New Quantum Evolutionary Algorithm in 0-1 Knapsack Problem

  • Jialin Li
  • Wei LiEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 986)

Abstract

As a common optimization problem in the field of operations research. Knapsack problem (KP) is often used in many areas, such as business, combinatorial mathematics, computational complexity theory, cryptography and applied mathematics. Based on the characteristics of 0-1 knapsack problem, this essay proposes an improved quantum evolutionary algorithm (IQEA) based on dynamic rotation angle catastrophe technology and designs a quantum rotating gate operator which adaptively adjusts the values of rotation angle according to the fitness value and evolution generations. In the process of evolution, the early quantum rotation angle is used to carry out the catastrophic operation of some individuals. The individual and the individual after the catastrophe are evolved in parallel, and the multipath optimization is carried out to improve the parallelism of the algorithm. This can effectively make the population jump out of the current optimal solution, increase the diversity of the population, carry out multi direction search, and maintain the stability of the population, and ensure that the excellent information in the subpopulation will not be lost. The experimental results of the typical knapsack problem show that the performance of the algorithm is better than the traditional evolutionary algorithm and the traditional quantum evolutionary algorithm in solving the knapsack problem.

Keywords

Knapsack problem Quantum evolutionary algorithm Dynamic quantum angle Catastrophic technology 

References

  1. 1.
    Mathews, G.B.: On the partition of numbers. Lond. Math. Soc. 28, 486–490 (1897)zbMATHGoogle Scholar
  2. 2.
    Wang, X.Z., He, Y.C.: Evolutionary algorithms for knapsack problems. Ruan Jian Xue Bao/J. Softw. 28(1), 1–16 (2017). (in Chinese)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Narayanan, A., Moore, M.: Quantum inspired genetic algorithm. In: IEEE International Conference on Evolutionary Computation, Iscataway, pp. 61–66 (1996)Google Scholar
  4. 4.
    Han, K.-H., Kim, J.-H.: Genetic quantum algorithm and its application to optimization problem. In: Proceedings of the 2000 IEEE Congress on Evolutionary. IEEE Press, USA, pp. 1354–1360 (2000)Google Scholar
  5. 5.
    Han, K.-H., Park, K.-H., Lee, C.-H.: Parallel quantum inspired genetic combinatorial optimization problem. In: Proceedings of the 2001 IEEE Congress on Combinatorial Computation algorithm for Evolutionary Computation. IEEE Press, USA, pp. 1422–1429 (2001)Google Scholar
  6. 6.
    Han, K.-H., Kim, J.-H.: On the analysis of the quantum-inspired evolutionary algorithm with a single individual. In: Proceedings of the 2006 IEEE Congress on Evolutionary Computation. IEEE Press, USA, pp. 2622–2629 (2006)Google Scholar
  7. 7.
    Yang, J.A., et al.: Multi-cosmic parallel quantum genetic algorithm. Chin. J. Electron. 32(6), 923–928 (2004)Google Scholar
  8. 8.
    Zhang, G.X., et al.: A novel quantum genetic algorithm and its application. ACTA Electr. Sin. 32(3), 476–479 (2004)MathSciNetGoogle Scholar
  9. 9.
    Chen, H., et al.: Chaos updating rotated gates quantum-inspired genetic algorithm. In: Proceedings of the International Conference on Communications, Circuits and systems, vol. 2, pp. 1108–1112 (2004)Google Scholar
  10. 10.
    Ling, W., et al.: Hybrid numerical optimization genetic algorithm based on quantum computing for and parameter estimation. Appl. Math. Comput. 171, 1141–1156 (2005)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Li, S., et al.: Quantum genetic algorithm based on real coding and gradient of objective function. J. Harbin Univ. Technol. 38(8), 1216–1218, 1223 (2006)Google Scholar
  12. 12.
    Liang, X.: Research on the application of evolutionary algorithms and quantum computing in optimization problems. China University of Science and Technology (2012).  https://doi.org/10.7666/d.y2125828
  13. 13.
    Bhatia, A.K., Basu, S.K.: Tackling 0/1 knapsack problem with gene induction. Soft. Comput. 8(1), 1–9 (2003)CrossRefGoogle Scholar
  14. 14.
    Li, J.L., et al.: A new quantum rotation angle of quantum-inspired evolutionary algorithm for TSP. Int. J. High Perform. Syst. Arch. 7(4), 223–230 (2017)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.School of Science and TechnologyGannan Normal UniversityGanzhouChina
  2. 2.School of Information EngineeringJiangxi University of Science and TechnologyGanzhouChina

Personalised recommendations