Travelling Salesman Problem

[game_federer]

Hi,
Newbie here. I'm looking for a solution to the salesman problem where the algo is minimum of each row. For eg.

1 2 3 4
1 - 7 8 3
2 7 - 5 1
3 8 5 - 4
4 3 1 5 -

We have 4 places to go 1,2,3,4 and then we've to come back to 1. In this, the guy will go from 1 to 4 first since 3 in the first row this is the least value. From 3 it will move to 4, from 4 to 2 and then back to 1.

Your help would be greatly appreciated.

 

[Nebu]

Hi:

You can do this using solvers . Here is a link which explains the step-by-step approach to the same.
http://blog.excelmasterseries.com/2014/05/solving-traveling-salesman-problem-with.html

Thanks