Team of travelling salesmen.

33 Views Asked by At

A team of salesmen from a company go on tour and market / sell one of their products

  1. They start from the same town $a$
  2. When they are done they meet in the same town $b$.
  3. A list of towns shall have been visited by at least one salesman.

We know:

  1. The costs and time to travel between each pair of towns to be visited (incl. $a$ and $b$).
  2. The cost of each salesman's time.

We want to minimize the

  1. Cost of travel for all salesmen.
  2. Total idle time cost. I.e. the cost of the sum of time each traveller has to wait at $b$ for the last salesman to arrive.

Can we formulate this as an optimization problem?