I want to design 10 city tsp problem for three workers.. Details for every worker:Working 1 weekVisiting 2 sites per daySo 10 sites in weekThe city 20 km squire....So I want to assume distance for all...

· Worker travels within the 20 km square city.
· There are 3 workers and every worker visit 10 cites.
· They have the same starting point and the same ending point.
· The assumed travel distances (in kilometers) between any two places in a city of 20 km length and 20 km width are listed in the following table.
· No worker is allowed to travel from same origin (starting points) to the same destination (ending points). For the same ∞ values are indicates within the transportation table.
Transportation problem – Table of Contents
    Transportation problem of Travelling sales man
    Different places in a city
(For worker-1, worker-2 & worker-3)
    
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    Different places in a city
(For worker-1, worker-2 & worker-3)
    1
    ∞
    2
    3
    1
    4
    2
    1
    3
    1
    3
    
    2
    2
    ∞
    1
    5
    1
    1
    2
    3
    2
    2
    
    3
    3
    1
    ∞
    1
    2
    3
    4
    1
    2
    3
    
    4
    1
    5
    1
    ∞
    1
    1
    2
    3
    4
    2
    
    5
    4
    1
    2
    1
    ∞
    2
    1
    4
    2
    3
    
    6
    2
    1
    3
    1
    2
    ∞
    4
    2
    3
    2
    
    7
    1
    2
    4
    2
    1
    4
    ∞
    1
    4
    1
    
    8
    3
    3
    1
    3
    4
    2
    1
    ∞
    1
    2
    
    9
    1
    2
    2
    4
    2
    3
    4
    1
    ∞
    1
    
    10
    3
    2
    3
    2
    3
    2
    1
    2
    1
    ∞
Applying the row and column minimization techniques in sequence: (as per the cutting plane and branch and bound...