Abstract
As a well-known combinatorial optimization problem, knapsack problems commonly arise in security areas. In this paper, an improved quantum-inspired evolutionary algorithm (PEQIEA) is proposed to solve knapsack problems. In PEQIEA, in each iteration, the state preference of the elite group is used to update the group. The elite group of each iteration consists of a certain number of individuals which are selected by their fitness values. A state preference is proposed to improve the efficiency of the algorithm. A new quantum-inspired gate is obtained by the elite group and their state preference. The Q-gate is then used to make the evolution of the group. The parameters in PEQIEA, which affect the accuracy and efficiency of the algorithm, are discussed empirically. The performance of PEQIEA is then evaluated through extensive experiments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rastaghi, R.: New approach for CCA2-secure post-quantum cryptosystem using knapsack problem. Comput. Sci. (2012)
Fu, Z., Ren, K., Shu, J., Sun, X., Huang, F.: Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans. Parallel Distrib. Syst. 27(9), 2546–2559 (2016)
Qu, Z., Keeney, J., Robitzsch, S., Zaman, F., Wang, X.: Multilevel pattern mining architecture for automatic network monitoring in heterogeneous wireless communication networks. Chin. Commun. 13(7), 108–116 (2016)
Xue, Y., Jiang, J., Zhao, B., Ma, T.: A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput. (2017)
Holland, J.: Adaptation in Natural and Artificial System. University of Michigan Press, Ann Arbor (1975)
Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6, 580–593 (2002)
Zhang, G.X.: Quantum-inspired evolutionary algorithms: a survey and empirical study. J. Heuristics 17, 303–351 (2011)
Zhang, G.X.: Time-frequency atom decomposition with quantum-inspired evolutionary algorithms. Circ. Syst. Sig. Process. 29, 209–233 (2010)
Manju, A., Nigam, M.J.: Applications of quantum inspired computational intelligence: a survey. Artif. Intell. Rev. (2012)
Narayanan, A., Moore, M.: Quantum-inspired genetic algorithms. In: Proceedings of the ICEC, pp. 61–66, Nagoya, Japan (1996)
Zhang, G.X., Li, N., Jin, W.D.: Novel quantum genetic algorithm and its application. Frontiers Electr. Electron. Eng. Chin. 1, 31–36 (2006)
Vlachogiannis, J.G., Lee, K.Y.: Quantum-inspired evolutionary algorithm for real and reactive power dispatch. IEEE Trans. Power Syst. 23, 1627–1636 (2008)
Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme. IEEE Trans. Evol. Comput. 8, 156–169 (2004)
Zhang, G.X., Rong, H.N.: Parameter setting of quantum-inspired genetic algorithm based on real observation. In: Proceedings of the RSKT, vol. 4481, pp. 492–499, Toronto, Ont, Canada (2007)
Liu, H.W., Zhang, G.X., Liu, C.X., Fang, C.: A novel memetic algorithm based on real-observation quantum-inspired evolutionary algorithms. In: Proceedings of the ISKE, pp. 486–490, Xiamen, China (2008)
Abs da Cruz, A.V., Hall Barbosa, C.R., Pacheco, M.A.C., Vellasco, M.: Quantum-inspired evolutionary algorithms and its application to numerical optimization problems. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 212–217. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30499-9_31
Babu, G.S.S., Das, D.B., Patvardhan, C.: Real-parameter quantum evolutionary algorithm for economic load dispatch. IET Gener. Transm. Distrib. 2, 21–31 (2008)
Li, N., Du, P., Zhao, H.J.: Independent component analysis based on improved quantum genetic algorithm: application in hyperspectral images. In: IGARSS, vol. 6, pp. 4323–4326 (2005)
Zhang, G., Rong, H.: Improved quantum-inspired genetic algorithm based time-frequency analysis of radar emitter signals. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS, vol. 4481, pp. 484–491. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72458-2_60
Li, Y., Zhang, Y.N., Zhao, R.C., Jiao, L.C.: The immune quantum-inspired evolutionary algorithm. In: IEEE ICSMC, vol. 4, pp. 3301–3305, Xi’an, China (2004)
Wang, L., Feng, X.Y., Huang, Y.X., Pu, D.B., Zhou, W.G., Liang, Y.C., Zhou, C.G.: A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70, 633–640 (2007)
Zhang, R., Gao, H.: Improved quantum evolutionary algorithm for combinatorial optimization problem. In: ICMLC, vol. 6, pp. 3501–3505, Hong Kong, China (2007)
Zhang, G.X.: A quantum-inspired evolutionary algorithm based on p systems for knapsack problem. Fundam. Inform. 87, 93–116 (2008)
Qin, Y., Zhang, G., Li, Y., Zhang, H.: A comprehensive learning quantum-inspired evolutionary algorithm. In: Qu, X., Yang, Y. (eds.) IBI 2011. CCIS, vol. 268, pp. 151–157. Springer, Heidelberg (2012). doi:10.1007/978-3-642-29087-9_22
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, Oxford (1979)
Kim, J.H., Myung, H.: Evolutionary programming techniques for constrained optimization problems. IEEE Trans. Evol. Comput. 1, 129–140 (1997)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution. Springer, New York (1999). doi:10.1007/978-3-662-03315-9
Garcia, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J. Heuristics 15, 617–644 (2009)
Layeb, A.: A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems. Appl. Math. Comput. 253, 14–25 (2013)
Gao, J., He, G., Liang, R., Feng, Z.: A quantum-inspired artificial immune system for the multiobjective 0–1 knapsack problem. Appl. Math. Comput. 230, 120–137 (2014)
Chiang, H.-P., Chou, Y.-H., Chiu, C.-H., Kuo, S.-Y., Huang, Y.-M.: A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems. Soft. Comput. 18, 1771–1781 (2014)
Patvardhan, C., Bansal, S., Srivastav, A.: Quantum-inspired evolutionary algorithm for difficult knapsack problems. Memet. Comput. 7, 135–155 (2015)
Xiang, S., He, Y.G.: A quantum-inspired evolutionary algorithm with elite group guided. In: Applied Mechanics and Materials, vol. 738–739, pp. 323–333 (2015)
Acknowledgments
This work was supported by the National Natural Science Foundation of China under Grant Nos. 51577046, 51607004, the State Key Program of National Natural Science Foundation of China under Grant No. 51637004, the national key research and development plan “important scientific instruments and equipment development” Grant No. 2016YFF0102200, Anhui Provincial Natural Science Foundation No. 1608085QF157, and Key projects of Anhui Province university outstanding youth talent support program No. gxyqZD2016207. This work was supported by the China Scholar Council.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Xiang, S., He, Y., Chang, L., Wu, K., Zhang, C. (2017). An Improved Quantum-Inspired Evolutionary Algorithm for Knapsack Problems. In: Sun, X., Chao, HC., You, X., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2017. Lecture Notes in Computer Science(), vol 10603. Springer, Cham. https://doi.org/10.1007/978-3-319-68542-7_60
Download citation
DOI: https://doi.org/10.1007/978-3-319-68542-7_60
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68541-0
Online ISBN: 978-3-319-68542-7
eBook Packages: Computer ScienceComputer Science (R0)