A chaotic annealing neural network with gain sharpening and its application to the 0/1 knapsack problem
In this article we present a modified transiently chaotic neural network model and then use it to solve the 0/1 knapsack problem. During the chaotic searching the gain of the neurons is gradually sharpened, this strategy can accelerate the convergence of the network to a binary state and keep the satisfaction of the constraints. The simulation demonstrates that the approach is efficient both in approximating the global solution and the number of iterations.
chaotic annealing neural network knapsack problem