To search, Click below search items.

 

All Published Papers Search Service

Title

A Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems

Author

Yi HE, Yuhui QIU, Guangyuan LIU1

Citation

Vol. 6  No. 5  pp. 87-92

Abstract

The knapsack problems are a classic NP-hard problem in the combinational optimization. Inspired by the conclusion of the cognitive psychology about the human memory system, a Tabu Search method based on Double Tabu-List (DTL-TS) has been proposed to solve it. With the addition of the search strategy of intensification and diversification, the excellent experiment results have been gotten. Compared with ImmunoDominance Clone Algorithm, DTL-TS is shown to be an efficient approach of solving complex problems like 0-1 multidimensional knapsack problems.

Keywords

Tabu Search, Double tabu-list, Multidimensional Knapsack Problem

URL

http://paper.ijcsns.org/07_book/200605/200605A13.pdf