Todays Lecture:

Travelling salesman Problem

Faculty: Ch.Rakesh
Date: 03-12-2020
Time: 12:00-1:00 PM
Travelling SaleSman Problem:

• A salesman stationed at city A has to decide his tour plan

to visit cities B,C,D,E and back to city A finally in the order
of his choice so that total distance travelled is mimum. No
sub touring is allowed. He cannot travel from a city to
same city itself. The distance between the cities in
kilometers is given below:
Cities A B C D E

A - 16 18 13 20

B 21 - 16 27 14

C 12 14 - 15 21

D 11 18 19 - 21

E 16 14 17 12 -
Row Minimization

Cities A B C D E

A - 3 5 0 7

B 7 - 2 13 0

C 0 2 - 3 9

D 0 7 8 - 10

E 4 2 5 0 -
Column Minimization

Cities A B C D E

A - 1 3 0 7

B 7 - 0 13 0

C 0 0 - 3 9

D 0 5 6 - 10

E 4 0 3 0 -
Row Scanning and Column Scanning

Cities A B C D E

A - 1 3 0 7

B 7 - 0 13 0

C 0 0 - 3 9

D 0 5 6 - 10

E 4 0 3 0 -
Modified Table

Cities A B C D E

A - 1 0 0 4

B 10 - 0 16 0

C 0 0 - 3 6

D 0 5 3 - 7

E 4 0 0 0 -
Row Scanning and Column Scanning

Cities A B C D E

A - 1 0 0 4

B 10 - 0 16 0

C 0 0 - 3 6

D 0 5 3 - 7

E 4 0 0 0 -
Optimal Route

A C B E D A
Total time taken by the travelling salesaman is:
18 + 14 + 14 + 12 + 11 = 69 kms