ISSN:
1573-773X
Keywords:
knapsack problem
;
chaotic annealing
;
neural network
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018603904290
Permalink