%0 Journal Article %A DuanBing Chen %T A Quasi-human Heuristic Algorithm for Multidimensional 0-1 Knapsack Problem %D 2006 %R %J Computer Engineering and Applications %P 17-19 %V 42 %N 2 %X Multidimensional 0-1 knapsack problem often appears in decision making and programming, resource distribution, loading, and so on. For solving this problem, many algorithms such as simulated annealing, genetic algorithm, ant colony algorithm, and other heuristic algorithms have been proposed by scholars. In this paper, a quasi-human heuristic algorithm for 0-1 knapsack is proposed. The algorithm utilizes two important strategies, i.e., how to select the item based on its average value and how to escape the trap. 55 multidimensional 0-1 knapsack test instances are tested by the produced algorithm, 54 instances of them achieve optimum solutions. The integrated performance of the produced algorithm is rather satisfied, and the runtime is short. Experimental results demonstrate that the algorithm proposed in this paper is rather efficient for solving multidimensional 0-1 knapsack problem. %U http://cea.ceaj.org/EN/abstract/article_15510.shtml