Asymmetric Neural Network and Its Application to Knapsack Problem

Akira YAMAMOTO  Masaya OHTA  Hiroshi UEDA  Akio OGIHARA  Kunio FUKUNAGA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E78-A   No.3   pp.300-305
Publication Date: 1995/03/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 7th Karuizawa Workshop on Circuits and Systems)
Category: Neural Networks
neural network,  asymmetric connection matrix,  knapsack problem,  

Full Text: PDF>>
Buy this Article

We propose an asymmetric neural network which can solve inequality-constrained combinatorial optimization problems that are difficult to solve using symmetric neural networks. In this article, a knapsack problem that is one of such the problem is solved using the proposed network. Additionally, we study condition for obtaining a valid solution. In computer simulations, we show that the condition is correct and that the proposed network produces better solutions than the simple greedy algorithm.