A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem

Multidimensional Knapsack Problem (MKP), as a classic combinatorial optimization problem, is used widely in various fields such as capital budgeting, allocating processors and databases in a distributed computer system. In this paper, a chaotic neural network combined heuristic strategy (TCNN-HS) is proposed for MKP. The proposed algorithm combines heuristic strategy which includes repair operator and improvement operator so that not only the infeasible solution can be overcome, but also the quality of the solutions can be improved. The TCNN-HS is tested on some benchmark problems, which is selected from OR library. Simulation results show that the proposed approach can find optimal solutions for some instances and outperforms TCNN.

[1]  Jiahai Wang,et al.  An improved transiently chaotic neural network for the maximum independent set problem , 2004, Int. J. Neural Syst..

[2]  Chou-Yuan Lee,et al.  A New Approach for Solving 0/1 Knapsack Problem , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[3]  Li Zhang,et al.  Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems , 2006, ICNC.

[4]  Yew-Soon Ong,et al.  Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I , 2005, ICNC.

[5]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[6]  Zhenya He,et al.  A Chaotic Annealing Neural Network with Gain Sharpening and Its Application to the 0/1 Knapsack Problem , 2004, Neural Processing Letters.

[7]  Carsten Peterson,et al.  Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem , 1993, Neural Computation.

[8]  Mattias Ohlsson,et al.  A Study of the Mean Field Approach to Knapsack Problems , 1997, Neural Networks.

[9]  Andreas Drexl,et al.  A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.

[10]  Reinaldo J. Moraga,et al.  Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem , 2005, Comput. Ind. Eng..

[11]  Kazuyuki Aihara,et al.  Chaotic simulated annealing by a neural network model with transient chaos , 1995, Neural Networks.

[12]  Hanxiao Shi,et al.  Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm , 2006, 2006 IEEE International Conference on Information Acquisition.