TITLE:
An Algorithm of 0-1 Knapsack Problem Based on Economic Model
AUTHORS:
Yingying Tian, Jianhui Lv, Liang Zheng
KEYWORDS:
0-1 Knapsack; Economic Model; Optimization Algorithm; Storage Space
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.1 No.4,
November
6,
2013
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.