A Chaotic Annealing Neural Network with Gain Sharpening and Its Application to the 0/1 Knapsack Problem

Authors:
Baoyun Wang;Heng Dong;Zhenya He
Affiliations:
Dept. of Inform. Eng., Nanjing Univ. of Posts & Telecomm., Nanjing 210003, China, e-mail: bywang@njupt.edu.cn;Dept. of Comm. Eng., Nanjing Univ. of Posts & Telecomm., Nanjing 210003, China;Dept. of Radio Eng., Southeast Univ., Nanjing 210096, China
Venue:
Neural Processing Letters
Year:
1999

Citing 4
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Neural networks for optimization problems with inequality constraints: the knapsack problem

Neural Computation
Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
A study of the mean field approach to knapsack problems

Neural Networks

A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem

ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.