An Algorithm of 0-1 Knapsack Problem Based on Economic Model

HTML  Download Download as PDF (Size: 236KB)  PP. 31-35  
DOI: 10.4236/jamp.2013.14006    6,171 Downloads   9,557 Views  Citations

ABSTRACT

In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.

Share and Cite:

Tian, Y. , Lv, J. and Zheng, L. (2013) An Algorithm of 0-1 Knapsack Problem Based on Economic Model. Journal of Applied Mathematics and Physics, 1, 31-35. doi: 10.4236/jamp.2013.14006.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.