Traveling Salesman Inverted 112
source link: https://www.codeabbey.com/index/forum_topic/d6fd915f81e076a09e99f8b9bace09a4
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
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?
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.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK