Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

A New Hopfield Network Used to Solve TSP Problems

GAN Neng-qiang,DU Hong-ming(Southwest Jiaotong University,Chengdu 610031,China)  
In solving the traveling salesman problem(TSP) with the Hopfield network,there are problems of getting invalid solutions and having low convergence rate.This paper introduces Hopfield neural networks with positive self-feedbacks.From simulations,it can be seen that it has some advantages in solving the TSP problem such as obtaining effective solution easily,fast convergence rate and less iterations.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved