Question

Given a list of cities and their pair wise distances, the task is to find a shortest possible tour that visits each city exactly once. A salesman has to visit five cities A, B, C, D and E. The distances (in hundred kilometers) between the five cities are shown in the following Table: | | To City A | To City B | To City C | To City D | To City E | |---|---|---|---|---|---| | From City A | - | 2 | 7 | 9 | 5 | | From City B | 8 | - | 9 | 6 | 7 | | From City C | 7 | 9 | - | 10 | 8 | | From City D | 9 | 6 | 10 | - | 9 | | From City E | 5 | 3 | 8 | 9 | - | If the salesman starts from city A and has to come back to city A. Use a new Alternate Method of an assignment problem to find out, which route should he selects so that the total distance traveled becomes minimum.

          Given a list of cities and their pair wise distances, the task is to find a shortest possible tour that visits each city exactly once. A salesman has to visit five cities A, B, C, D and E. The distances (in hundred kilometers) between the five cities are shown in the following Table:

| | To City A | To City B | To City C | To City D | To City E |
|---|---|---|---|---|---|
| From City A | - | 2 | 7 | 9 | 5 |
| From City B | 8 | - | 9 | 6 | 7 |
| From City C | 7 | 9 | - | 10 | 8 |
| From City D | 9 | 6 | 10 | - | 9 |
| From City E | 5 | 3 | 8 | 9 | - |

If the salesman starts from city A and has to come back to city A. Use a new Alternate Method of an assignment problem to find out, which route should he selects so that the total distance traveled becomes minimum.

Given a list of cities and their pair wise distances, the task is to find a shortest possible tour that visits each city exactly once. A salesman has to visit five cities A, B, C, D and E. The distances (in hundred kilometers) between the five cities are shown in the following Table:

| | To City A | To City B | To City C | To City D | To City E |
|—|—|—|—|—|—|
| From City A | - | 2 | 7 | 9 | 5 |
| From City B | 8 | - | 9 | 6 | 7 |
| From City C | 7 | 9 | - | 10 | 8 |
| From City D | 9 | 6 | 10 | - | 9 |
| From City E | 5 | 3 | 8 | 9 | - |

If the salesman starts from city A and has to come back to city A. Use a new Alternate Method of an assignment problem to find out, which route should he selects so that the total distance traveled becomes minimum.

Added by Raymond S.

Question

Please give Ace some feedback