A Simple Learning Algorithm for the Traveling Salesman Problem

Details A Simple Learning Algorithm for the Traveling Salesman Problem A Simple Learning Algorithm for the Traveling Salesman Problem

1996-08-15

arxiv.org/abs/adap-org/9608003v1

Nonlinear Sciences

Adaptation and Self-Organizing Systems

10 pages, Latex, 3 postscript figures

Scientific paper

10.1103/PhysRevE.55.7809

We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation: i) A tour is selected by choosing cities probabilistically according to the ``synaptic'' strengths between cities. ii) The ``synaptic'' strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of the previous trials. We perform extensive simulations of the random distance traveling-salesman problem. For sufficiently slow learning rates, near optimal tours can be obtained with the average optimal tour lengths close to the lower bounds for the shortest tour lengths.

Affiliated with

Also associated with

No associations

Rating

A Simple Learning Algorithm for the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simple Learning Algorithm for the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Learning Algorithm for the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572745