An Efficient Heuristic Algorithm for Solving 0-1 Knapsack Problem

The model for 0-1 knapsack problem based on greedy strategy and expectation efficiency has some advantages, e.g., quick convergence and low complexity, but it also inherently exists some limitations to be enhanced and improved, such as the restricted greedy and the overmuch calculation on expectation efficiency. To this end, an efficient algorithm is proposed to optimize the previous model. At first, the greedy degree is maximized, that is, some items are permanently loaded into knapsack in advance as many as possible. Then, the conventional expectation efficiency model is improved greatly, at the same time, the number of calculations with respect to expectation efficiency is decreased by ignoring some unnecessary items. Compared to the previous algorithm, the experimental results reveal that the proposed optimization algorithm has the significant advantages in time.