A team of salesmen from a company go on tour and market / sell one of their products
- They start from the same town $a$
- When they are done they meet in the same town $b$.
- A list of towns shall have been visited by at least one salesman.
We know:
- The costs and time to travel between each pair of towns to be visited (incl. $a$ and $b$).
- The cost of each salesman's time.
We want to minimize the
- Cost of travel for all salesmen.
- 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?