An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem


In this Letter we show that discrete multivalued Hopfield-type neural networks enable a relatively easy formulation of the Traveling Salesman Problem compared to the traditional Hopfield model. Thus, with the multivalued representation the network can be easily confined to feasible solutions, avoiding the need to tune any parameter. An investigation into… (More)
DOI: 10.1023/A:1012751230791


5 Figures and Tables