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

24Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Gao, Y., Zhang, F., Zhao, Y., & Li, C. (2018). Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem. Mathematical Problems in Engineering, 2018. https://doi.org/10.1155/2018/5327056

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free