Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 5327056, 10 pages
Research Article

Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem

Air Force Engineering University, Xi’an, Shanxi, China

Correspondence should be addressed to Yangjun Gao; moc.liamg@8002ysierg

Received 3 November 2017; Accepted 8 May 2018; Published 20 June 2018

Academic Editor: Emilio Insfran Pelozo

Copyright © 2018 Yangjun Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper proposes a Quantum-Inspired wolf pack algorithm (QWPA) based on quantum encoding to enhance the performance of the wolf pack algorithm (WPA) to solve the 0-1 knapsack problems. There are two important operations in QWPA: quantum rotation and quantum collapse. The first step enables the population to move to the global optima and the second step helps to avoid the trapping of individuals into local optima. Ten classical and four high-dimensional knapsack problems are employed to test the proposed algorithm, and the results are compared with other typical algorithms. The statistical results demonstrate the effectiveness and global search capability for knapsack problems, especially for high-level cases.