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.
Similar content being viewed by others
References
L. Chen and K. Aihara, “Chaotic simulated annealing by a neural networkmodel with transient chaos, ” Neural Networks, Vol. 8, pp. 915–930, 1995.
B.W. Lee and B. Sheu, “Parallel hardware annealing for optimal solutions on electronic neural networks, ” IEEE Trans. Neural Networks, Vol. 4, pp. 588–598, 1993.
S. Martelloand P. Toth, Knapsack Problems - Algorithms and Computer Implementation, John Wiley, Chichester, 1990.
M. Ohlsson, C. Peterson and B. Soderberg, “Neural networks for optimizationproblems with inequality constraints - knapsack problem, ” Neural Computation, Vol. 5, pp. 331–339, 1993.
M. Ohlsson and H. Pi, “A study of the mean field approach toknapsack problems, ” Neural Networks, Vol. 10, pp. 263–271, 1997.
C. Petersonand B. Soderberg, “A new method for mapping optimization problems into neural networks, ” Int. J. Neural Syst., Vol. 1, pp. 3–22, 1989.
B. Wang and Z. He, “Toimplement CDMA multiuser detector by using the transiently chaotic neural networks, ” IEEE Trans. Aerosp. Elect. Syst., Vol. 33, No. 3, pp. 1068–1071, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, B., Dong, H. & He, Z. A Chaotic Annealing Neural Network with Gain Sharpening and Its Application to the 0/1 Knapsack Problem. Neural Processing Letters 9, 243–247 (1999). https://doi.org/10.1023/A:1018603904290
Issue Date:
DOI: https://doi.org/10.1023/A:1018603904290