Traveling Salesman Inverted 112
Back to Problem Solutions forum
Good everybody! Obviously that we take branch and bound method as default for solving. But what's wrong? For simple city with 50 city's i fast find way. But this task realy stomped my PC. May be for this problem need another theory? can someone give me kick to show direction for theory?
score = collected_money / (6 * 99)
I don't undestand collected_money? Is it the cumulative sum of money from travel? And the divisor (6*99): is it fixed-6 per road or 6 is only an example number and really varies with the road used.
Quote: "Here 6 is the maximum amount of money which could be saved on any road and 99 - maximum amount of roads which could be traversed."
Thus 6*99 is the maximum amount of money that you can save/collect by visiting all 100 cities, and dividing by it
normalises the result to a number between 0.0 and 1.0.
Click on the View Stats link at the top of the problem page to see what others have achieved: path value = money saved, and score = score.
OK. I got the idea.