Abstract: Aiming at 0-1 knapsack problem which is a typical combinatorial optimization problem, a TS algorithm based on double-tabu objects was proposed.Firstly, the proposed algorithm regards on one component of solution vector as solution object to execute tabu search.After this search process, it looks upon the current optimal solution as initial solution object to carry out tabu search again.The experiment results show the proposed TS algorithm based on double-tabu objects can effectively solve the 0-1 knapsack problem.