1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Travelling Salesmen Problem bounce and bound (Estimate Function)

  1. Dec 5, 2011 #1
    1. The problem statement, all variables and given/known data
    So I have been given an algorithm that solves this problem. However, the aim was to make it faster and I have done this. The problem is I fail to explain why it has made the algorithm faster. It's more of a math problem which I haven't understood. I solved this through trail and error.

    Let me explain further, imagine the TSP in tree form. The algorithm calculates the partical cost of each branch and adds it to how many nodes are left time 50. Now I increased 50 to 100. The algorithm worked faster and got to the goal node quicker. How did this happen?

    partical cost + how many more steps * 50


    thank you in advance
     
  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?



Similar Discussions: Travelling Salesmen Problem bounce and bound (Estimate Function)
Loading...