Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Approximate Traveling Salesperson Problem

  1. Mar 13, 2010 #1
    I was wondering if somebody could explain me how to apply the approximate algorithm to a 5-vertex matrix. The solution is as follows: 2-3-5-1-4-2

    What I'm not sure is how do I choose the next set

    Matrix: (Notice is symmetric)
    The approximate Traveling Salesperson Tour construction (approximate algorithm) OR also called Quick Traveling Salesperson Construction

    Code (Text):
        T1  T2  T3  T4 T5
      ------------------
    T1| -   3   2   4   3
    T2| 3   -   4   5   5
    T3| 2   4   -   4   4
    T4| 4   5   4   -   6
    T5| 3   5   4   6   -
     
    Last edited: Mar 13, 2010
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted



Similar Discussions: Approximate Traveling Salesperson Problem
  1. Travelling Problem (Replies: 1)

  2. Normal Approximation (Replies: 2)

  3. Poisson Approximation (Replies: 5)

  4. Aysmptotic Approximation (Replies: 13)

Loading...