A Recurrent Neural Network to Traveling Salesman Problem

Siqueira, Paulo Henrique; Scheer, Sérgio; Steiner, María Teresinha Arns

doi:10.5772/5578

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Other2

Book1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Recurrent Neural Network With Soft 'Winner Takes All' Principle for the TSP

Siqueira¹,

Steiner²,

Scheer³

2010

Proceedings of the International Conference on Fuzzy Computation and 2nd International Conference on Neural Computation

View full text Add to dashboard Cite

This paper shows the application of Wang's Recurrent Neural Network with the 'Winner Takes All' (WTA) principle in a soft version to solve the Traveling Salesman Problem. In soft WTA principle the winner neuron is updated at each iteration with part of the value of each competing neuron and some comparisons with the hard WTA are made in this work with instances of the TSPLIB (Traveling Salesman Problem Library). The results show that the soft WTA guarantees equal or better results than the hard WTA in most of the problems tested.

show abstract