Application of a Modified Hopfield Network to the Traveling Salesman Problem

@inproceedings{Nagrny2009ApplicationOA,
  title={Application of a Modified Hopfield Network to the Traveling Salesman Problem},
  author={Zbigniew Nag{\'o}rny},
  year={2009}
}
This paper presents the results of the application of the modified Hopfield network to the travelling salesman problem (TSP). A cost function of the TSP consists of four components: two terms which ensure that the salesman's tour is valid, the term which forces neurons to have the output signal equal to 0 or 1, and the total length of the salesman's tour. For two 10-city benchmarks the average tour length of obtained solutions is equal to the optimal tour length. Other works did not report such… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.