On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts

Details On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts

2006-08-27

arxiv.org/abs/physics/0608269v1

Physics

Computational Physics

13 pages, 4 figures

Scientific paper

When trying to find approximate solutions for the Traveling Salesman Problem
with heuristic optimization algorithms, small moves called Lin-$k$-Opts are
often used. In our paper, we provide exact formulas for the numbers of possible
tours into which a randomly chosen tour can be changed with a Lin-$k$-Opt.

Affiliated with

Also associated with

No associations

Rating

On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts 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 On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31380